/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:49:52,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:49:52,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:49:52,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:49:52,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:49:52,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:49:52,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:49:52,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:49:52,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:49:52,799 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:49:52,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:49:52,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:49:52,801 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:49:52,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:49:52,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:49:52,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:49:52,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:49:52,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:49:52,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:49:52,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:49:52,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:49:52,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:49:52,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:49:52,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:49:52,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:49:52,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:49:52,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:49:52,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:49:52,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:49:52,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:49:52,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:49:52,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:49:52,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:49:52,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:49:52,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:49:52,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:49:52,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:49:52,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:49:52,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:49:52,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:49:52,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:49:52,825 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:49:52,840 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:49:52,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:49:52,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:49:52,841 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:49:52,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:49:52,841 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:49:52,842 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:49:52,842 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:49:52,842 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:49:52,842 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:49:52,842 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:49:52,842 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:49:52,843 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:49:52,843 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:49:52,843 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:49:52,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:49:52,843 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:49:52,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:49:52,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:49:52,844 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:49:52,844 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:49:52,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:49:52,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:49:52,845 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:49:52,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:49:52,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:49:52,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:49:52,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:49:52,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:49:53,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:49:53,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:49:53,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:49:53,030 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:49:53,030 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:49:53,031 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:49:53,098 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_3V0kUz/tmp/b398313e19ec41edae02a5e35ce06543/FLAG8b365d125 [2020-07-01 12:49:53,431 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:49:53,432 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:49:53,432 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:49:53,439 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_3V0kUz/tmp/b398313e19ec41edae02a5e35ce06543/FLAG8b365d125 [2020-07-01 12:49:53,837 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_3V0kUz/tmp/b398313e19ec41edae02a5e35ce06543 [2020-07-01 12:49:53,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:49:53,850 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:49:53,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:49:53,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:49:53,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:49:53,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:49:53" (1/1) ... [2020-07-01 12:49:53,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462d1ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53, skipping insertion in model container [2020-07-01 12:49:53,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:49:53" (1/1) ... [2020-07-01 12:49:53,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:49:53,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:49:54,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:49:54,134 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:49:54,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:49:54,170 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:49:54,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:54 WrapperNode [2020-07-01 12:49:54,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:49:54,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:49:54,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:49:54,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:49:54,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:54" (1/1) ... [2020-07-01 12:49:54,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:54" (1/1) ... [2020-07-01 12:49:54,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:49:54,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:49:54,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:49:54,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:49:54,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:54" (1/1) ... [2020-07-01 12:49:54,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:54" (1/1) ... [2020-07-01 12:49:54,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:54" (1/1) ... [2020-07-01 12:49:54,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:54" (1/1) ... [2020-07-01 12:49:54,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:54" (1/1) ... [2020-07-01 12:49:54,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:54" (1/1) ... [2020-07-01 12:49:54,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:54" (1/1) ... [2020-07-01 12:49:54,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:49:54,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:49:54,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:49:54,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:49:54,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:54" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:49:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:49:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:49:54,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:49:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:49:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:49:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:49:54,687 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:49:54,687 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:49:54,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:49:54 BoogieIcfgContainer [2020-07-01 12:49:54,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:49:54,692 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:49:54,693 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:49:54,695 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:49:54,695 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:49:54" (1/1) ... [2020-07-01 12:49:54,712 INFO L313 BlockEncoder]: Initial Icfg 70 locations, 72 edges [2020-07-01 12:49:54,714 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:49:54,714 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:49:54,715 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:49:54,715 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:49:54,717 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:49:54,718 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:49:54,718 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:49:54,747 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:49:54,805 INFO L200 BlockEncoder]: SBE split 39 edges [2020-07-01 12:49:54,810 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:49:54,812 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:49:54,859 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding [2020-07-01 12:49:54,862 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:49:54,864 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:49:54,864 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:49:54,865 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:49:54,865 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:49:54,866 INFO L313 BlockEncoder]: Encoded RCFG 60 locations, 130 edges [2020-07-01 12:49:54,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:49:54 BasicIcfg [2020-07-01 12:49:54,866 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:49:54,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:49:54,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:49:54,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:49:54,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:49:53" (1/4) ... [2020-07-01 12:49:54,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420481cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:49:54, skipping insertion in model container [2020-07-01 12:49:54,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:54" (2/4) ... [2020-07-01 12:49:54,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420481cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:49:54, skipping insertion in model container [2020-07-01 12:49:54,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:49:54" (3/4) ... [2020-07-01 12:49:54,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420481cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:49:54, skipping insertion in model container [2020-07-01 12:49:54,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:49:54" (4/4) ... [2020-07-01 12:49:54,875 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:49:54,886 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:49:54,894 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2020-07-01 12:49:54,909 INFO L251 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2020-07-01 12:49:54,933 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:49:54,934 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:49:54,934 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:49:54,934 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:49:54,934 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:49:54,934 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:49:54,934 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:49:54,934 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:49:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2020-07-01 12:49:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:49:54,957 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:54,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:49:54,959 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:54,965 INFO L82 PathProgramCache]: Analyzing trace with hash 148628, now seen corresponding path program 1 times [2020-07-01 12:49:54,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:54,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795753180] [2020-07-01 12:49:54,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:55,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795753180] [2020-07-01 12:49:55,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:55,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:55,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195845981] [2020-07-01 12:49:55,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:55,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:55,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:55,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,170 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2020-07-01 12:49:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:55,475 INFO L93 Difference]: Finished difference Result 118 states and 227 transitions. [2020-07-01 12:49:55,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:55,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:49:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:55,489 INFO L225 Difference]: With dead ends: 118 [2020-07-01 12:49:55,489 INFO L226 Difference]: Without dead ends: 60 [2020-07-01 12:49:55,493 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-01 12:49:55,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-07-01 12:49:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-01 12:49:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 99 transitions. [2020-07-01 12:49:55,534 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 99 transitions. Word has length 3 [2020-07-01 12:49:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:55,535 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 99 transitions. [2020-07-01 12:49:55,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 99 transitions. [2020-07-01 12:49:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:49:55,536 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:55,536 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:49:55,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:49:55,538 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:55,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:55,538 INFO L82 PathProgramCache]: Analyzing trace with hash 149031, now seen corresponding path program 1 times [2020-07-01 12:49:55,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:55,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126769990] [2020-07-01 12:49:55,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:55,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126769990] [2020-07-01 12:49:55,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:55,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:55,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745786300] [2020-07-01 12:49:55,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:55,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:55,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:55,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,621 INFO L87 Difference]: Start difference. First operand 60 states and 99 transitions. Second operand 3 states. [2020-07-01 12:49:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:55,824 INFO L93 Difference]: Finished difference Result 60 states and 99 transitions. [2020-07-01 12:49:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:55,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:49:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:55,826 INFO L225 Difference]: With dead ends: 60 [2020-07-01 12:49:55,827 INFO L226 Difference]: Without dead ends: 56 [2020-07-01 12:49:55,828 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-01 12:49:55,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-01 12:49:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-01 12:49:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 91 transitions. [2020-07-01 12:49:55,834 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 91 transitions. Word has length 3 [2020-07-01 12:49:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:55,835 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 91 transitions. [2020-07-01 12:49:55,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 91 transitions. [2020-07-01 12:49:55,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:49:55,835 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:55,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:49:55,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:49:55,836 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:55,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:55,836 INFO L82 PathProgramCache]: Analyzing trace with hash 149033, now seen corresponding path program 1 times [2020-07-01 12:49:55,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:55,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068424359] [2020-07-01 12:49:55,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:55,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068424359] [2020-07-01 12:49:55,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:55,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:55,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716601233] [2020-07-01 12:49:55,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:55,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:55,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:55,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,878 INFO L87 Difference]: Start difference. First operand 56 states and 91 transitions. Second operand 3 states. [2020-07-01 12:49:55,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:55,987 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2020-07-01 12:49:55,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:55,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:49:55,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:55,989 INFO L225 Difference]: With dead ends: 60 [2020-07-01 12:49:55,989 INFO L226 Difference]: Without dead ends: 56 [2020-07-01 12:49:55,990 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-01 12:49:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-01 12:49:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-01 12:49:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 87 transitions. [2020-07-01 12:49:55,996 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 87 transitions. Word has length 3 [2020-07-01 12:49:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:55,997 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 87 transitions. [2020-07-01 12:49:55,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2020-07-01 12:49:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:49:55,997 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:55,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:49:55,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:49:55,998 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:55,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:55,998 INFO L82 PathProgramCache]: Analyzing trace with hash 149034, now seen corresponding path program 1 times [2020-07-01 12:49:55,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:55,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133080427] [2020-07-01 12:49:55,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:56,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133080427] [2020-07-01 12:49:56,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:56,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:56,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444660270] [2020-07-01 12:49:56,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:56,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:56,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:56,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,062 INFO L87 Difference]: Start difference. First operand 56 states and 87 transitions. Second operand 3 states. [2020-07-01 12:49:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:56,185 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-07-01 12:49:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:56,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:49:56,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:56,187 INFO L225 Difference]: With dead ends: 56 [2020-07-01 12:49:56,187 INFO L226 Difference]: Without dead ends: 52 [2020-07-01 12:49:56,187 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-01 12:49:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-01 12:49:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-01 12:49:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 83 transitions. [2020-07-01 12:49:56,193 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 83 transitions. Word has length 3 [2020-07-01 12:49:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:56,193 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 83 transitions. [2020-07-01 12:49:56,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions. [2020-07-01 12:49:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:49:56,194 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:56,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:49:56,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:49:56,194 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:56,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:56,195 INFO L82 PathProgramCache]: Analyzing trace with hash 4617189, now seen corresponding path program 1 times [2020-07-01 12:49:56,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:56,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436392006] [2020-07-01 12:49:56,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:56,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436392006] [2020-07-01 12:49:56,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:56,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:56,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866187840] [2020-07-01 12:49:56,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:56,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:56,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:56,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,261 INFO L87 Difference]: Start difference. First operand 52 states and 83 transitions. Second operand 3 states. [2020-07-01 12:49:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:56,370 INFO L93 Difference]: Finished difference Result 52 states and 83 transitions. [2020-07-01 12:49:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:56,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:49:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:56,372 INFO L225 Difference]: With dead ends: 52 [2020-07-01 12:49:56,372 INFO L226 Difference]: Without dead ends: 48 [2020-07-01 12:49:56,372 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-01 12:49:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-01 12:49:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-01 12:49:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 75 transitions. [2020-07-01 12:49:56,377 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 75 transitions. Word has length 4 [2020-07-01 12:49:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:56,377 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 75 transitions. [2020-07-01 12:49:56,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 75 transitions. [2020-07-01 12:49:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:49:56,378 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:56,378 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:49:56,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:49:56,378 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:56,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:56,379 INFO L82 PathProgramCache]: Analyzing trace with hash 4617191, now seen corresponding path program 1 times [2020-07-01 12:49:56,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:56,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388308078] [2020-07-01 12:49:56,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:56,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388308078] [2020-07-01 12:49:56,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:56,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:56,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185195330] [2020-07-01 12:49:56,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:56,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:56,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:56,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,433 INFO L87 Difference]: Start difference. First operand 48 states and 75 transitions. Second operand 3 states. [2020-07-01 12:49:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:56,539 INFO L93 Difference]: Finished difference Result 48 states and 75 transitions. [2020-07-01 12:49:56,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:56,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:49:56,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:56,541 INFO L225 Difference]: With dead ends: 48 [2020-07-01 12:49:56,541 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 12:49:56,541 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 12:49:56,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-01 12:49:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 12:49:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2020-07-01 12:49:56,546 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 4 [2020-07-01 12:49:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:56,546 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 67 transitions. [2020-07-01 12:49:56,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 67 transitions. [2020-07-01 12:49:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:49:56,547 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:56,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:49:56,547 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:49:56,547 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:56,548 INFO L82 PathProgramCache]: Analyzing trace with hash 143129875, now seen corresponding path program 1 times [2020-07-01 12:49:56,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:56,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714031726] [2020-07-01 12:49:56,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:56,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714031726] [2020-07-01 12:49:56,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:56,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:56,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56652931] [2020-07-01 12:49:56,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:56,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:56,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:56,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,590 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. Second operand 3 states. [2020-07-01 12:49:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:56,683 INFO L93 Difference]: Finished difference Result 44 states and 67 transitions. [2020-07-01 12:49:56,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:56,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:49:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:56,684 INFO L225 Difference]: With dead ends: 44 [2020-07-01 12:49:56,684 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 12:49:56,685 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 12:49:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 12:49:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:49:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2020-07-01 12:49:56,689 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 5 [2020-07-01 12:49:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:56,689 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2020-07-01 12:49:56,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2020-07-01 12:49:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:49:56,690 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:56,690 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:49:56,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:49:56,690 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:56,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:56,691 INFO L82 PathProgramCache]: Analyzing trace with hash 143129876, now seen corresponding path program 1 times [2020-07-01 12:49:56,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:56,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395181189] [2020-07-01 12:49:56,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:56,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395181189] [2020-07-01 12:49:56,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:56,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:56,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299513026] [2020-07-01 12:49:56,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:56,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:56,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:56,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,721 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 3 states. [2020-07-01 12:49:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:56,783 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2020-07-01 12:49:56,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:56,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:49:56,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:56,784 INFO L225 Difference]: With dead ends: 44 [2020-07-01 12:49:56,784 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 12:49:56,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 12:49:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 12:49:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:49:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2020-07-01 12:49:56,788 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 5 [2020-07-01 12:49:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:56,789 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2020-07-01 12:49:56,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2020-07-01 12:49:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:49:56,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:56,789 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:49:56,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:49:56,790 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:56,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:56,790 INFO L82 PathProgramCache]: Analyzing trace with hash 143129877, now seen corresponding path program 1 times [2020-07-01 12:49:56,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:56,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302134351] [2020-07-01 12:49:56,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:56,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302134351] [2020-07-01 12:49:56,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:56,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:56,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869316766] [2020-07-01 12:49:56,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:56,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:56,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:56,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,837 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 3 states. [2020-07-01 12:49:56,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:56,917 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2020-07-01 12:49:56,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:56,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:49:56,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:56,919 INFO L225 Difference]: With dead ends: 41 [2020-07-01 12:49:56,919 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 12:49:56,920 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 12:49:56,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-01 12:49:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 12:49:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2020-07-01 12:49:56,923 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 5 [2020-07-01 12:49:56,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:56,923 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2020-07-01 12:49:56,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2020-07-01 12:49:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:49:56,924 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:56,924 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:49:56,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:49:56,925 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:56,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:56,925 INFO L82 PathProgramCache]: Analyzing trace with hash 142056437, now seen corresponding path program 1 times [2020-07-01 12:49:56,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:56,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761967796] [2020-07-01 12:49:56,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:56,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761967796] [2020-07-01 12:49:56,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:56,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:56,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444413423] [2020-07-01 12:49:56,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:56,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:56,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,979 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 3 states. [2020-07-01 12:49:57,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:57,041 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2020-07-01 12:49:57,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:57,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:49:57,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:57,042 INFO L225 Difference]: With dead ends: 38 [2020-07-01 12:49:57,042 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:49:57,043 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:57,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:49:57,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 12:49:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:49:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2020-07-01 12:49:57,046 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 6 [2020-07-01 12:49:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:57,046 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2020-07-01 12:49:57,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2020-07-01 12:49:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:49:57,047 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:57,047 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:49:57,047 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:49:57,047 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:57,048 INFO L82 PathProgramCache]: Analyzing trace with hash 142056439, now seen corresponding path program 1 times [2020-07-01 12:49:57,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:57,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833924246] [2020-07-01 12:49:57,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:57,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833924246] [2020-07-01 12:49:57,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:57,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:57,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443682618] [2020-07-01 12:49:57,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:57,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:57,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:57,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:57,077 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2020-07-01 12:49:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:57,118 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-01 12:49:57,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:57,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:49:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:57,119 INFO L225 Difference]: With dead ends: 38 [2020-07-01 12:49:57,119 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:49:57,120 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:57,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:49:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 12:49:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:49:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2020-07-01 12:49:57,123 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 6 [2020-07-01 12:49:57,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:57,123 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2020-07-01 12:49:57,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2020-07-01 12:49:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:49:57,124 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:57,124 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:49:57,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:49:57,124 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:57,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:57,125 INFO L82 PathProgramCache]: Analyzing trace with hash 142056440, now seen corresponding path program 1 times [2020-07-01 12:49:57,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:57,125 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867069459] [2020-07-01 12:49:57,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:57,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867069459] [2020-07-01 12:49:57,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:57,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:57,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686372270] [2020-07-01 12:49:57,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:57,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:57,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:57,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:57,172 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 3 states. [2020-07-01 12:49:57,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:57,229 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-07-01 12:49:57,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:57,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:49:57,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:57,230 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:49:57,231 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:49:57,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:49:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:49:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:49:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-07-01 12:49:57,235 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 6 [2020-07-01 12:49:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:57,235 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-07-01 12:49:57,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2020-07-01 12:49:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:49:57,236 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:57,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:49:57,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 12:49:57,236 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:57,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:57,236 INFO L82 PathProgramCache]: Analyzing trace with hash 108778096, now seen corresponding path program 1 times [2020-07-01 12:49:57,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:57,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134894324] [2020-07-01 12:49:57,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:57,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134894324] [2020-07-01 12:49:57,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:57,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:57,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000639944] [2020-07-01 12:49:57,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:57,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:57,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:57,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:57,277 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 3 states. [2020-07-01 12:49:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:57,337 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2020-07-01 12:49:57,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:57,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:49:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:57,338 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:49:57,338 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:49:57,339 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:57,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:49:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:49:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:49:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-01 12:49:57,342 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 7 [2020-07-01 12:49:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:57,342 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-01 12:49:57,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-01 12:49:57,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:49:57,343 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:57,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:49:57,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 12:49:57,343 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:57,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:57,343 INFO L82 PathProgramCache]: Analyzing trace with hash 108778098, now seen corresponding path program 1 times [2020-07-01 12:49:57,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:57,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875191263] [2020-07-01 12:49:57,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:57,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875191263] [2020-07-01 12:49:57,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:57,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:57,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520170172] [2020-07-01 12:49:57,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:57,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:57,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:57,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:57,368 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 3 states. [2020-07-01 12:49:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:57,395 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-01 12:49:57,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:57,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:49:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:57,396 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:49:57,396 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:49:57,397 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:49:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:49:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:49:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-07-01 12:49:57,400 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 7 [2020-07-01 12:49:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:57,400 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-01 12:49:57,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-01 12:49:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:49:57,401 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:57,401 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:49:57,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 12:49:57,401 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:57,401 INFO L82 PathProgramCache]: Analyzing trace with hash 108778099, now seen corresponding path program 1 times [2020-07-01 12:49:57,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:57,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179500689] [2020-07-01 12:49:57,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:57,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179500689] [2020-07-01 12:49:57,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:57,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:57,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821646254] [2020-07-01 12:49:57,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:57,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:57,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:57,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:57,447 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 3 states. [2020-07-01 12:49:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:57,489 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-01 12:49:57,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:57,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:49:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:57,490 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:49:57,490 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:49:57,490 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:57,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:49:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:49:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:49:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:49:57,491 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2020-07-01 12:49:57,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:57,491 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:49:57,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:49:57,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:49:57,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 12:49:57,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:49:57,548 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 12:49:57,549 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-01 12:49:57,549 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:49:57,549 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:49:57,549 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:49:57,549 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:49:57,549 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:49:57,549 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:49:57,549 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:49:57,550 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:49:57,550 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:49:57,550 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:49:57,550 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:49:57,550 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:49:57,550 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:49:57,550 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:49:57,550 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 12:49:57,550 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-01 12:49:57,551 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:49:57,551 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:49:57,551 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:49:57,551 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:49:57,551 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:49:57,551 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 12:49:57,551 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:49:57,551 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:49:57,551 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:49:57,551 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-01 12:49:57,552 INFO L268 CegarLoopResult]: For program point L21-1(line 21) no Hoare annotation was computed. [2020-07-01 12:49:57,552 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:49:57,552 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:49:57,552 INFO L268 CegarLoopResult]: For program point L17-2(line 17) no Hoare annotation was computed. [2020-07-01 12:49:57,552 INFO L268 CegarLoopResult]: For program point L17-3(line 17) no Hoare annotation was computed. [2020-07-01 12:49:57,552 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:49:57,552 INFO L268 CegarLoopResult]: For program point L17-5(lines 17 23) no Hoare annotation was computed. [2020-07-01 12:49:57,553 INFO L264 CegarLoopResult]: At program point L17-7(lines 16 23) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~k_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~i_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_test_fun_~j_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_test_fun_~i_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 0 ULTIMATE.start_test_fun_~j_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_test_fun_~k_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= (select |#length| ULTIMATE.start_test_fun_~i_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~tmp_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~k_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_test_fun_~j_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~tmp_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_test_fun_~tmp_ref~0.base))) [2020-07-01 12:49:57,553 INFO L268 CegarLoopResult]: For program point L17-8(lines 17 23) no Hoare annotation was computed. [2020-07-01 12:49:57,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:49:57,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:49:57,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:49:57,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:49:57,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:49:57,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:49:57,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:49:57,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:49:57,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:49:57,554 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-01 12:49:57,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:49:57,554 INFO L268 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-07-01 12:49:57,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:49:57,554 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:49:57,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:49:57,555 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 12:49:57,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:49:57,555 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:49:57,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:49:57,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:49:57,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:49:57,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:49:57,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:49:57,558 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:49:57,568 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:49:57,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,577 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:49:57,577 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,578 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,578 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,578 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,578 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:49:57 BasicIcfg [2020-07-01 12:49:57,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:49:57,581 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:49:57,581 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:49:57,585 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:49:57,585 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:49:57,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:49:53" (1/5) ... [2020-07-01 12:49:57,586 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26bab0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:49:57, skipping insertion in model container [2020-07-01 12:49:57,586 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:49:57,586 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:54" (2/5) ... [2020-07-01 12:49:57,586 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26bab0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:49:57, skipping insertion in model container [2020-07-01 12:49:57,587 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:49:57,587 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:49:54" (3/5) ... [2020-07-01 12:49:57,587 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26bab0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:49:57, skipping insertion in model container [2020-07-01 12:49:57,587 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:49:57,587 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:49:54" (4/5) ... [2020-07-01 12:49:57,587 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26bab0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:49:57, skipping insertion in model container [2020-07-01 12:49:57,588 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:49:57,588 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:49:57" (5/5) ... [2020-07-01 12:49:57,589 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:49:57,610 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:49:57,610 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:49:57,610 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:49:57,610 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:49:57,610 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:49:57,610 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:49:57,610 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:49:57,611 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:49:57,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. [2020-07-01 12:49:57,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-07-01 12:49:57,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:49:57,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:49:57,626 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:49:57,626 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:49:57,627 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:49:57,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. [2020-07-01 12:49:57,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-07-01 12:49:57,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:49:57,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:49:57,630 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:49:57,630 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:49:57,636 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [117] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9#L-1true [230] L-1-->L12: Formula: (let ((.cse2 (store |v_#valid_8| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1))) (and (= v_ULTIMATE.start_test_fun_~i_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc4.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= v_ULTIMATE.start_test_fun_~k_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc4.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~k_1 |v_ULTIMATE.start_test_fun_#in~k_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~k_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (= v_ULTIMATE.start_test_fun_~i_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc4.base_1| 4) |v_#length_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|)) (= v_ULTIMATE.start_test_fun_~k_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~i_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (= (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1| 1) |v_#valid_3|) (= |v_ULTIMATE.start_test_fun_#in~j_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) (= 0 (select .cse3 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) (= |v_ULTIMATE.start_test_fun_#in~tmp_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= v_ULTIMATE.start_test_fun_~j_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~tmp_1 |v_ULTIMATE.start_test_fun_#in~tmp_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= v_ULTIMATE.start_test_fun_~j_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~j_1 |v_ULTIMATE.start_test_fun_#in~j_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= v_ULTIMATE.start_test_fun_~i_1 |v_ULTIMATE.start_test_fun_#in~i_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1, ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_1, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~malloc4.offset=|v_ULTIMATE.start_test_fun_#t~malloc4.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_1, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_#in~k=|v_ULTIMATE.start_test_fun_#in~k_1|, ULTIMATE.start_test_fun_#in~j=|v_ULTIMATE.start_test_fun_#in~j_1|, ULTIMATE.start_test_fun_#in~i=|v_ULTIMATE.start_test_fun_#in~i_1|, ULTIMATE.start_test_fun_~k=v_ULTIMATE.start_test_fun_~k_1, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_1, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#in~tmp=|v_ULTIMATE.start_test_fun_#in~tmp_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_1|, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_1, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_test_fun_#t~malloc4.base=|v_ULTIMATE.start_test_fun_#t~malloc4.base_1|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~tmp_ref~0.base, ULTIMATE.start_test_fun_~j_ref~0.offset, ULTIMATE.start_test_fun_~tmp_ref~0.offset, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~i_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~malloc4.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~i, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_~k_ref~0.offset, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_#in~k, ULTIMATE.start_test_fun_#in~j, ULTIMATE.start_test_fun_#in~i, ULTIMATE.start_test_fun_~k, ULTIMATE.start_test_fun_~j, ULTIMATE.start_test_fun_~tmp, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#in~tmp, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short7, ULTIMATE.start_test_fun_~i_ref~0.base, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_~j_ref~0.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_~k_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_test_fun_#t~malloc4.base, ULTIMATE.start_test_fun_~c~0.base] 44#L12true [134] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~i_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~i_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~i_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~i_ref~0.base_3) v_ULTIMATE.start_test_fun_~i_ref~0.offset_3 v_ULTIMATE.start_test_fun_~i_3))) (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_3, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_3, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 43#L12-1true [131] L12-1-->L13: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~j_ref~0.base_3)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~j_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~j_ref~0.base_3) v_ULTIMATE.start_test_fun_~j_ref~0.offset_3 v_ULTIMATE.start_test_fun_~j_3))) (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~j_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_3, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_3} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_3, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_3} AuxVars[] AssignedVars[#memory_int] 60#L13true [155] L13-->L14: Formula: (and (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~k_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~k_ref~0.base_3) v_ULTIMATE.start_test_fun_~k_ref~0.offset_3 v_ULTIMATE.start_test_fun_~k_3)) |v_#memory_int_5|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~k_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~k_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~k_ref~0.offset_3 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~k_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_3, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~k=v_ULTIMATE.start_test_fun_~k_3} OutVars{ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_3, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~k=v_ULTIMATE.start_test_fun_~k_3} AuxVars[] AssignedVars[#memory_int] 16#L14true [101] L14-->L15: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3)) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 v_ULTIMATE.start_test_fun_~tmp_3)) |v_#memory_int_7|) (= 1 (select |v_#valid_15| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|} AuxVars[] AssignedVars[#memory_int] 18#L15true [104] L15-->L17-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_10| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_9|) (= 1 (select |v_#valid_17| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_17|} OutVars{#memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#memory_int] 57#L17-7true [2020-07-01 12:49:57,637 INFO L796 eck$LassoCheckResult]: Loop: 57#L17-7true [149] L17-7-->L17: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~i_ref~0.base_6)) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~i_ref~0.base_6) v_ULTIMATE.start_test_fun_~i_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem5_2|) (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_5) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~i_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_5, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_6, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_5, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 52#L17true [259] L17-->L17-1: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem5_3| 100) (not |v_ULTIMATE.start_test_fun_#t~short7_2|)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short7] 50#L17-1true [141] L17-1-->L17-5: Formula: (not |v_ULTIMATE.start_test_fun_#t~short7_5|) InVars {ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_5|} OutVars{ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_5|} AuxVars[] AssignedVars[] 59#L17-5true [153] L17-5-->L18: Formula: |v_ULTIMATE.start_test_fun_#t~short7_9| InVars {ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_9|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short7, ULTIMATE.start_test_fun_#t~mem6] 7#L18true [92] L18-->L18-1: Formula: (and (= 1 (select |v_#valid_23| v_ULTIMATE.start_test_fun_~i_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_7) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~i_ref~0.base_9) v_ULTIMATE.start_test_fun_~i_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~i_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_7, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_9, #valid=|v_#valid_23|} OutVars{#valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_7, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 6#L18-1true [309] L18-1-->L19: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12)) (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9 |v_ULTIMATE.start_test_fun_#t~mem8_6|)) |v_#memory_int_31|)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_32|, #length=|v_#length_45|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_45|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 24#L19true [111] L19-->L19-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_7 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~j_ref~0.base_9)) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~j_ref~0.base_9) 1) (= (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~j_ref~0.base_9) v_ULTIMATE.start_test_fun_~j_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem9_2|) (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_7, #length=|v_#length_25|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_9, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_7, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_9, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_16|, #length=|v_#length_25|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 22#L19-1true [312] L19-1-->L20: Formula: (and (= 1 (select |v_#valid_60| v_ULTIMATE.start_test_fun_~i_ref~0.base_15)) (= (store |v_#memory_int_36| v_ULTIMATE.start_test_fun_~i_ref~0.base_15 (store (select |v_#memory_int_36| v_ULTIMATE.start_test_fun_~i_ref~0.base_15) v_ULTIMATE.start_test_fun_~i_ref~0.offset_11 |v_ULTIMATE.start_test_fun_#t~mem9_6|)) |v_#memory_int_35|) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_11 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~i_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_11)) InVars {#valid=|v_#valid_60|, #memory_int=|v_#memory_int_36|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_15} OutVars{#valid=|v_#valid_60|, #memory_int=|v_#memory_int_35|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_15} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 39#L20true [128] L20-->L20-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9))) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, #memory_int=|v_#memory_int_19|, #length=|v_#length_29|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_19|, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 36#L20-1true [313] L20-1-->L21: Formula: (and (= (store |v_#memory_int_38| v_ULTIMATE.start_test_fun_~j_ref~0.base_15 (store (select |v_#memory_int_38| v_ULTIMATE.start_test_fun_~j_ref~0.base_15) v_ULTIMATE.start_test_fun_~j_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_37|) (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_11 4) (select |v_#length_49| v_ULTIMATE.start_test_fun_~j_ref~0.base_15)) (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~j_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_11)) InVars {ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_15, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_38|, #length=|v_#length_49|} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_15, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_37|, #length=|v_#length_49|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 11#L21true [97] L21-->L21-1: Formula: (and (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~k_ref~0.base_6) v_ULTIMATE.start_test_fun_~k_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~k_ref~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~k_ref~0.offset_5) (= 1 (select |v_#valid_35| v_ULTIMATE.start_test_fun_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_22|, ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_5, #length=|v_#length_33|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_6, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_5, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_6, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_22|, #length=|v_#length_33|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 56#L21-1true [314] L21-1-->L22: Formula: (and (= 1 (select |v_#valid_62| v_ULTIMATE.start_test_fun_~k_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~k_ref~0.offset_9) (= (store |v_#memory_int_40| v_ULTIMATE.start_test_fun_~k_ref~0.base_12 (store (select |v_#memory_int_40| v_ULTIMATE.start_test_fun_~k_ref~0.base_12) v_ULTIMATE.start_test_fun_~k_ref~0.offset_9 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| (- 1)))) |v_#memory_int_39|) (<= (+ v_ULTIMATE.start_test_fun_~k_ref~0.offset_9 4) (select |v_#length_50| v_ULTIMATE.start_test_fun_~k_ref~0.base_12))) InVars {ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_9, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_12, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_40|, #length=|v_#length_50|} OutVars{ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_9, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_12, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_39|, #length=|v_#length_50|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 29#L22true [118] L22-->L22-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem12_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5)) InVars {#memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 26#L22-1true [315] L22-1-->L17-7: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_51| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_42| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_42| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1))) |v_#memory_int_41|) (= 1 (select |v_#valid_63| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15)) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_42|, #length=|v_#length_51|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_41|, #length=|v_#length_51|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 57#L17-7true [2020-07-01 12:49:57,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:57,638 INFO L82 PathProgramCache]: Analyzing trace with hash 624102671, now seen corresponding path program 1 times [2020-07-01 12:49:57,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:57,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783405566] [2020-07-01 12:49:57,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:57,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783405566] [2020-07-01 12:49:57,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:57,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:57,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998996529] [2020-07-01 12:49:57,657 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:49:57,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:57,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2011602764, now seen corresponding path program 1 times [2020-07-01 12:49:57,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:57,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347525457] [2020-07-01 12:49:57,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:57,670 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347525457] [2020-07-01 12:49:57,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:57,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:49:57,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367060725] [2020-07-01 12:49:57,671 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:49:57,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:57,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:57,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:57,673 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2020-07-01 12:49:57,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:57,847 INFO L93 Difference]: Finished difference Result 60 states and 99 transitions. [2020-07-01 12:49:57,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:57,850 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:49:57,855 INFO L168 Benchmark]: Toolchain (without parser) took 4004.35 ms. Allocated memory was 514.9 MB in the beginning and 601.9 MB in the end (delta: 87.0 MB). Free memory was 438.4 MB in the beginning and 415.8 MB in the end (delta: 22.6 MB). Peak memory consumption was 109.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:57,855 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:49:57,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.24 ms. Allocated memory was 514.9 MB in the beginning and 565.7 MB in the end (delta: 50.9 MB). Free memory was 438.4 MB in the beginning and 531.8 MB in the end (delta: -93.3 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:57,856 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.98 ms. Allocated memory is still 565.7 MB. Free memory was 531.8 MB in the beginning and 529.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:57,857 INFO L168 Benchmark]: Boogie Preprocessor took 27.76 ms. Allocated memory is still 565.7 MB. Free memory was 529.7 MB in the beginning and 527.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:57,858 INFO L168 Benchmark]: RCFGBuilder took 446.74 ms. Allocated memory is still 565.7 MB. Free memory was 527.7 MB in the beginning and 498.0 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:57,858 INFO L168 Benchmark]: BlockEncodingV2 took 174.08 ms. Allocated memory is still 565.7 MB. Free memory was 498.0 MB in the beginning and 479.2 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:57,859 INFO L168 Benchmark]: TraceAbstraction took 2713.08 ms. Allocated memory was 565.7 MB in the beginning and 601.9 MB in the end (delta: 36.2 MB). Free memory was 478.6 MB in the beginning and 458.4 MB in the end (delta: 20.2 MB). Peak memory consumption was 56.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:57,859 INFO L168 Benchmark]: BuchiAutomizer took 270.90 ms. Allocated memory is still 601.9 MB. Free memory was 458.4 MB in the beginning and 415.8 MB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:57,863 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 70 locations, 72 edges - StatisticsResult: Encoded RCFG 60 locations, 130 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 320.24 ms. Allocated memory was 514.9 MB in the beginning and 565.7 MB in the end (delta: 50.9 MB). Free memory was 438.4 MB in the beginning and 531.8 MB in the end (delta: -93.3 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 44.98 ms. Allocated memory is still 565.7 MB. Free memory was 531.8 MB in the beginning and 529.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 27.76 ms. Allocated memory is still 565.7 MB. Free memory was 529.7 MB in the beginning and 527.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * RCFGBuilder took 446.74 ms. Allocated memory is still 565.7 MB. Free memory was 527.7 MB in the beginning and 498.0 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 174.08 ms. Allocated memory is still 565.7 MB. Free memory was 498.0 MB in the beginning and 479.2 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2713.08 ms. Allocated memory was 565.7 MB in the beginning and 601.9 MB in the end (delta: 36.2 MB). Free memory was 478.6 MB in the beginning and 458.4 MB in the end (delta: 20.2 MB). Peak memory consumption was 56.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 270.90 ms. Allocated memory is still 601.9 MB. Free memory was 458.4 MB in the beginning and 415.8 MB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2020-07-01 12:49:57,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:49:57,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,875 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:49:57,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:57,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((1 == \valid[k_ref] && 0 == i_ref) && 1 == \valid[j_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[i_ref]) && 1 == \valid[c]) && 0 == j_ref) && 4 == unknown-#length-unknown[k_ref]) && 4 == unknown-#length-unknown[c]) && unknown-#length-unknown[i_ref] == 4) && 1 == \valid[tmp_ref]) && 0 == k_ref) && 4 == unknown-#length-unknown[j_ref]) && 0 == tmp_ref) && 4 == unknown-#length-unknown[tmp_ref] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 36 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 147 SDtfs, 849 SDslu, 9 SDs, 0 SdLazy, 765 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 69 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 1237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:49:50.579 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_3V0kUz/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:49:58.101 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check