./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/array03-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/array03-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 987435cc8130e848f1b087d0b65ab8d71c3dfa3c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:10:15,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:10:15,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:10:15,462 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:10:15,462 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:10:15,463 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:10:15,471 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:10:15,472 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:10:15,473 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:10:15,474 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:10:15,475 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:10:15,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:10:15,479 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:10:15,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:10:15,481 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:10:15,481 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:10:15,482 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:10:15,483 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:10:15,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:10:15,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:10:15,497 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:10:15,497 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:10:15,499 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:10:15,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:10:15,499 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:10:15,502 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:10:15,505 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:10:15,505 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:10:15,506 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:10:15,507 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:10:15,507 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:10:15,507 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:10:15,507 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:10:15,508 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:10:15,510 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:10:15,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:10:15,511 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:10:15,526 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:10:15,526 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:10:15,528 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:10:15,529 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:10:15,529 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:10:15,530 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:10:15,530 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:10:15,531 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:10:15,531 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:10:15,531 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:10:15,531 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:10:15,532 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:10:15,532 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:10:15,532 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:10:15,532 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:10:15,532 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:10:15,532 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:10:15,533 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:10:15,533 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:10:15,533 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:10:15,533 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:10:15,533 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:10:15,533 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:10:15,533 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:10:15,534 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:10:15,534 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:10:15,534 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:10:15,535 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:10:15,535 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 987435cc8130e848f1b087d0b65ab8d71c3dfa3c [2018-10-27 06:10:15,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:10:15,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:10:15,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:10:15,604 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:10:15,604 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:10:15,605 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/array03-alloca_true-termination.c.i [2018-10-27 06:10:15,653 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/data/9ac46559a/0be78618f9064afbbc2e45020b6a323c/FLAGb287277a7 [2018-10-27 06:10:16,066 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:10:16,067 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/sv-benchmarks/c/termination-memory-alloca/array03-alloca_true-termination.c.i [2018-10-27 06:10:16,076 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/data/9ac46559a/0be78618f9064afbbc2e45020b6a323c/FLAGb287277a7 [2018-10-27 06:10:16,089 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/data/9ac46559a/0be78618f9064afbbc2e45020b6a323c [2018-10-27 06:10:16,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:10:16,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:10:16,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:16,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:10:16,097 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:10:16,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6934edcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16, skipping insertion in model container [2018-10-27 06:10:16,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:10:16,134 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:10:16,346 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:16,354 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:10:16,404 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:16,450 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:10:16,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16 WrapperNode [2018-10-27 06:10:16,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:16,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:16,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:10:16,454 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:10:16,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:16,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:10:16,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:10:16,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:10:16,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:10:16,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:10:16,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:10:16,584 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:10:16,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:10:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:10:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:10:16,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:10:17,102 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:10:17,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:17 BoogieIcfgContainer [2018-10-27 06:10:17,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:10:17,103 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:10:17,103 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:10:17,105 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:10:17,106 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:17,106 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:10:16" (1/3) ... [2018-10-27 06:10:17,107 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2925118b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:17, skipping insertion in model container [2018-10-27 06:10:17,107 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:17,107 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (2/3) ... [2018-10-27 06:10:17,107 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2925118b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:17, skipping insertion in model container [2018-10-27 06:10:17,107 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:17,108 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:17" (3/3) ... [2018-10-27 06:10:17,111 INFO L375 chiAutomizerObserver]: Analyzing ICFG array03-alloca_true-termination.c.i [2018-10-27 06:10:17,157 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:10:17,158 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:10:17,158 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:10:17,158 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:10:17,158 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:10:17,158 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:10:17,158 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:10:17,158 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:10:17,159 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:10:17,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:10:17,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:10:17,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:17,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:17,198 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:10:17,198 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:17,199 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:10:17,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:10:17,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:10:17,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:17,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:17,201 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:10:17,201 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:17,206 INFO L793 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 16#L567true assume !(main_~array_size~0 < 1); 18#L567-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 10#L551-3true [2018-10-27 06:10:17,207 INFO L795 eck$LassoCheckResult]: Loop: 10#L551-3true assume true; 25#L551-1true assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 21#L553true SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 23#L553-1true assume test_fun_#t~mem3 == 0;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 17#L558-3true assume !true; 20#L558-4true SUMMARY for call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558-4 24#L562true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 10#L551-3true [2018-10-27 06:10:17,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:17,211 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-10-27 06:10:17,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:17,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:17,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:17,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:17,307 INFO L82 PathProgramCache]: Analyzing trace with hash 929032042, now seen corresponding path program 1 times [2018-10-27 06:10:17,307 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:17,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:17,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:17,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:17,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:17,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:10:17,346 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:17,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:10:17,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:10:17,359 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-10-27 06:10:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:17,365 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-10-27 06:10:17,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:10:17,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2018-10-27 06:10:17,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:10:17,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 25 transitions. [2018-10-27 06:10:17,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:10:17,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:10:17,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2018-10-27 06:10:17,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:17,375 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-10-27 06:10:17,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2018-10-27 06:10:17,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-27 06:10:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 06:10:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-10-27 06:10:17,396 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-10-27 06:10:17,396 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-10-27 06:10:17,396 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:10:17,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-10-27 06:10:17,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:10:17,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:17,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:17,397 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:10:17,397 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:17,398 INFO L793 eck$LassoCheckResult]: Stem: 77#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 69#L567 assume !(main_~array_size~0 < 1); 70#L567-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 58#L551-3 [2018-10-27 06:10:17,398 INFO L795 eck$LassoCheckResult]: Loop: 58#L551-3 assume true; 59#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 75#L553 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 76#L553-1 assume test_fun_#t~mem3 == 0;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 68#L558-3 assume true; 60#L558 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558 61#L558-1 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 66#L558-4 SUMMARY for call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558-4 73#L562 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 58#L551-3 [2018-10-27 06:10:17,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:17,398 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-10-27 06:10:17,398 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:17,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:17,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:17,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:17,424 INFO L82 PathProgramCache]: Analyzing trace with hash -567716706, now seen corresponding path program 1 times [2018-10-27 06:10:17,424 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:17,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:17,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:17,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:17,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2080975558, now seen corresponding path program 1 times [2018-10-27 06:10:17,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:17,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:17,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:17,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,678 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-27 06:10:17,857 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-10-27 06:10:18,092 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-27 06:10:18,112 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:18,114 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:18,114 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:18,114 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:18,115 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:18,115 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:18,115 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:18,115 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:18,118 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:10:18,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:18,120 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:18,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,735 WARN L179 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-10-27 06:10:18,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:19,273 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:19,277 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:19,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:19,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:19,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:19,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:19,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:19,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:19,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:19,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:19,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:19,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:19,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:19,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:19,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:19,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:19,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:19,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:19,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:19,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:19,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:19,303 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:19,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:19,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:19,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:19,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:19,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:19,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:19,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:19,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:19,320 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:19,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:19,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:19,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:19,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:19,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:19,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:19,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:19,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:19,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:19,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:19,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:19,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:19,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:19,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:19,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:19,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:19,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:19,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:19,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,357 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:19,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,360 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:19,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:19,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:19,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:19,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:19,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:19,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:19,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:19,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:19,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:19,413 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:19,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:19,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:19,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:19,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:19,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:19,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:19,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:19,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:19,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:19,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:19,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:19,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:19,475 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:19,512 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:10:19,512 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:10:19,514 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:19,515 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:19,517 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:19,517 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-10-27 06:10:19,576 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:10:19,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:19,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:19,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:19,653 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:10:19,654 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:10:19,724 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 38 states and 46 transitions. Complement of second has 6 states. [2018-10-27 06:10:19,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:10:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-10-27 06:10:19,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 4 letters. Loop has 9 letters. [2018-10-27 06:10:19,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:19,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 9 letters. [2018-10-27 06:10:19,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:19,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 4 letters. Loop has 18 letters. [2018-10-27 06:10:19,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:19,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. [2018-10-27 06:10:19,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:19,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 44 transitions. [2018-10-27 06:10:19,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-10-27 06:10:19,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-10-27 06:10:19,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2018-10-27 06:10:19,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:19,734 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-10-27 06:10:19,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2018-10-27 06:10:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-27 06:10:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-27 06:10:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-10-27 06:10:19,738 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-10-27 06:10:19,738 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-10-27 06:10:19,738 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:10:19,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2018-10-27 06:10:19,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:19,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:19,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:19,739 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:19,739 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:19,740 INFO L793 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 219#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 212#L567 assume !(main_~array_size~0 < 1); 213#L567-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 191#L551-3 assume true; 193#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 220#L553 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 221#L553-1 assume test_fun_#t~mem3 == 0;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 210#L558-3 [2018-10-27 06:10:19,741 INFO L795 eck$LassoCheckResult]: Loop: 210#L558-3 assume true; 195#L558 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558 196#L558-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 207#L559 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L559 199#L559-1 test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6; 200#L560 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L560 225#L560-1 test_fun_#t~post8 := test_fun_#t~mem7; 203#L560-2 SUMMARY for call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L560-2 204#L560-3 havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 210#L558-3 [2018-10-27 06:10:19,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:19,742 INFO L82 PathProgramCache]: Analyzing trace with hash 176673837, now seen corresponding path program 1 times [2018-10-27 06:10:19,742 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:19,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:19,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:19,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:19,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:19,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:19,771 INFO L82 PathProgramCache]: Analyzing trace with hash 67643337, now seen corresponding path program 1 times [2018-10-27 06:10:19,771 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:19,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:19,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:19,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:19,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:19,777 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:10:19,777 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:10:19,777 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:10:19,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:19,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:19,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1347533539, now seen corresponding path program 1 times [2018-10-27 06:10:19,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:19,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:19,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:19,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:19,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:19,864 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:10:19,864 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:10:19,864 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:10:19,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:19,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:20,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-27 06:10:20,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-10-27 06:10:20,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:20,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:20,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:20,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-10-27 06:10:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:20,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:20,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:10:20,362 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 06:10:20,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:10:20,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:10:20,363 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-10-27 06:10:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:20,704 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-10-27 06:10:20,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:10:20,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2018-10-27 06:10:20,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:20,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 47 transitions. [2018-10-27 06:10:20,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-10-27 06:10:20,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-10-27 06:10:20,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2018-10-27 06:10:20,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:20,707 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-10-27 06:10:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2018-10-27 06:10:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-10-27 06:10:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-27 06:10:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-10-27 06:10:20,710 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-10-27 06:10:20,710 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-10-27 06:10:20,711 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:10:20,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-10-27 06:10:20,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:20,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:20,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:20,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:20,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:20,713 INFO L793 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 358#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 350#L567 assume !(main_~array_size~0 < 1); 351#L567-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 330#L551-3 assume true; 332#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 359#L553 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 360#L553-1 assume !(test_fun_#t~mem3 == 0);havoc test_fun_#t~mem3; 353#L555 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L555 354#L555-1 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 346#L558-3 [2018-10-27 06:10:20,713 INFO L795 eck$LassoCheckResult]: Loop: 346#L558-3 assume true; 342#L558 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558 343#L558-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 348#L559 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L559 334#L559-1 test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6; 335#L560 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L560 364#L560-1 test_fun_#t~post8 := test_fun_#t~mem7; 338#L560-2 SUMMARY for call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L560-2 339#L560-3 havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 346#L558-3 [2018-10-27 06:10:20,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:20,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2015131756, now seen corresponding path program 1 times [2018-10-27 06:10:20,714 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:20,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:20,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:20,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:20,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:20,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:20,754 INFO L82 PathProgramCache]: Analyzing trace with hash 67643337, now seen corresponding path program 2 times [2018-10-27 06:10:20,755 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:20,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:20,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:20,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:20,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:20,758 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:10:20,758 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:10:20,758 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:10:20,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:10:20,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-27 06:10:20,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-10-27 06:10:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:20,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:20,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1403488874, now seen corresponding path program 1 times [2018-10-27 06:10:20,821 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:20,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:20,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:20,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:20,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:20,829 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:10:20,829 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:10:20,829 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:10:20,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:21,483 WARN L179 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2018-10-27 06:10:21,542 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:21,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:21,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:21,542 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:21,542 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:21,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:21,543 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:21,543 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:21,543 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-termination.c.i_Iteration4_Lasso [2018-10-27 06:10:21,543 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:21,543 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:21,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,880 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-10-27 06:10:21,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:22,274 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:22,274 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:22,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:22,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:22,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:22,277 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:22,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:22,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:22,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:22,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:22,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:22,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:22,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:22,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:22,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:22,299 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,303 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:22,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,307 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:22,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:22,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:22,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:22,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:22,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:22,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:22,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:22,352 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:22,355 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:22,355 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:22,355 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:22,357 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:22,358 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:22,358 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_1 Supporting invariants [] [2018-10-27 06:10:22,425 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:10:22,429 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:22,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:22,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:22,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:22,612 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:22,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:10:22,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2018-10-27 06:10:22,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:22,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:22,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:22,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:10:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:22,647 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:10:22,647 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-10-27 06:10:22,733 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 9. Second operand 8 states. Result 112 states and 127 transitions. Complement of second has 13 states. [2018-10-27 06:10:22,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:10:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2018-10-27 06:10:22,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 10 letters. Loop has 9 letters. [2018-10-27 06:10:22,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:22,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 19 letters. Loop has 9 letters. [2018-10-27 06:10:22,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:22,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 10 letters. Loop has 18 letters. [2018-10-27 06:10:22,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:22,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 127 transitions. [2018-10-27 06:10:22,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-10-27 06:10:22,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 87 states and 100 transitions. [2018-10-27 06:10:22,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-10-27 06:10:22,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-10-27 06:10:22,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 100 transitions. [2018-10-27 06:10:22,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:22,740 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 100 transitions. [2018-10-27 06:10:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 100 transitions. [2018-10-27 06:10:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2018-10-27 06:10:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-27 06:10:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2018-10-27 06:10:22,747 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-10-27 06:10:22,747 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-10-27 06:10:22,747 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:10:22,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. [2018-10-27 06:10:22,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:22,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:22,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:22,749 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:22,750 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:22,750 INFO L793 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 624#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 613#L567 assume !(main_~array_size~0 < 1); 614#L567-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 588#L551-3 assume true; 590#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 636#L553 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 630#L553-1 assume !(test_fun_#t~mem3 == 0);havoc test_fun_#t~mem3; 631#L555 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L555 619#L555-1 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 606#L558-3 [2018-10-27 06:10:22,750 INFO L795 eck$LassoCheckResult]: Loop: 606#L558-3 assume true; 602#L558 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558 603#L558-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 610#L559 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L559 594#L559-1 test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6; 595#L560 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L560 637#L560-1 test_fun_#t~post8 := test_fun_#t~mem7; 598#L560-2 SUMMARY for call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L560-2 599#L560-3 havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 606#L558-3 [2018-10-27 06:10:22,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:22,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2015131758, now seen corresponding path program 1 times [2018-10-27 06:10:22,750 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:22,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:22,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:22,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:22,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:22,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:22,769 INFO L82 PathProgramCache]: Analyzing trace with hash 67643337, now seen corresponding path program 3 times [2018-10-27 06:10:22,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:22,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:22,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:22,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:22,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:22,771 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:10:22,771 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:10:22,771 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:10:22,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:10:22,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 06:10:22,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-10-27 06:10:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:22,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:22,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1010461864, now seen corresponding path program 1 times [2018-10-27 06:10:22,820 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:22,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:22,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:22,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:22,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:23,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:23,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:10:23,380 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 06:10:23,560 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 06:10:23,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:10:23,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:10:23,561 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-10-27 06:10:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:23,781 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-10-27 06:10:23,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:10:23,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 87 transitions. [2018-10-27 06:10:23,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:23,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 68 states and 77 transitions. [2018-10-27 06:10:23,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-10-27 06:10:23,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-10-27 06:10:23,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 77 transitions. [2018-10-27 06:10:23,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:23,784 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-10-27 06:10:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 77 transitions. [2018-10-27 06:10:23,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-10-27 06:10:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-27 06:10:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-10-27 06:10:23,787 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-10-27 06:10:23,787 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-10-27 06:10:23,787 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:10:23,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 69 transitions. [2018-10-27 06:10:23,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:23,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:23,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:23,793 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:23,793 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:23,793 INFO L793 eck$LassoCheckResult]: Stem: 785#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 780#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 771#L567 assume !(main_~array_size~0 < 1); 772#L567-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 750#L551-3 assume true; 751#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 788#L553 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 786#L553-1 assume !(test_fun_#t~mem3 == 0);havoc test_fun_#t~mem3; 776#L555 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L555 777#L555-1 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 778#L558-3 assume true; 809#L558 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558 801#L558-1 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 795#L558-4 SUMMARY for call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558-4 794#L562 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 792#L551-3 assume true; 787#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 781#L553 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 782#L553-1 assume !(test_fun_#t~mem3 == 0);havoc test_fun_#t~mem3; 774#L555 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L555 775#L555-1 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 767#L558-3 [2018-10-27 06:10:23,793 INFO L795 eck$LassoCheckResult]: Loop: 767#L558-3 assume true; 753#L558 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558 754#L558-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 765#L559 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L559 757#L559-1 test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6; 758#L560 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L560 789#L560-1 test_fun_#t~post8 := test_fun_#t~mem7; 761#L560-2 SUMMARY for call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L560-2 762#L560-3 havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 767#L558-3 [2018-10-27 06:10:23,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1359093602, now seen corresponding path program 1 times [2018-10-27 06:10:23,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:23,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:23,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:23,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:23,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:23,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 06:10:23,942 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:23,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:23,943 INFO L82 PathProgramCache]: Analyzing trace with hash 67643337, now seen corresponding path program 4 times [2018-10-27 06:10:23,943 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:23,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:23,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:23,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,946 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:10:23,946 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:10:23,946 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:10:23,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:10:23,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:10:23,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-10-27 06:10:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:24,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:10:24,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:10:24,053 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. cyclomatic complexity: 13 Second operand 7 states. [2018-10-27 06:10:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:24,110 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-10-27 06:10:24,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:10:24,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 101 transitions. [2018-10-27 06:10:24,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:24,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 91 states and 99 transitions. [2018-10-27 06:10:24,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-10-27 06:10:24,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-10-27 06:10:24,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 99 transitions. [2018-10-27 06:10:24,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:24,113 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-10-27 06:10:24,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 99 transitions. [2018-10-27 06:10:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 62. [2018-10-27 06:10:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-27 06:10:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-10-27 06:10:24,119 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-10-27 06:10:24,119 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-10-27 06:10:24,119 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:10:24,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 70 transitions. [2018-10-27 06:10:24,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:24,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:24,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:24,120 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:24,121 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:24,121 INFO L793 eck$LassoCheckResult]: Stem: 953#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 948#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 936#L567 assume !(main_~array_size~0 < 1); 937#L567-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 915#L551-3 assume true; 916#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 951#L553 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 952#L553-1 assume !(test_fun_#t~mem3 == 0);havoc test_fun_#t~mem3; 941#L555 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L555 942#L555-1 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 938#L558-3 assume true; 924#L558 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558 925#L558-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 973#L559 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L559 972#L559-1 test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6; 958#L560 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L560 959#L560-1 test_fun_#t~post8 := test_fun_#t~mem7; 920#L560-2 SUMMARY for call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L560-2 921#L560-3 havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 944#L558-3 assume true; 969#L558 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558 968#L558-1 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 963#L558-4 SUMMARY for call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558-4 962#L562 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 960#L551-3 assume true; 956#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 949#L553 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 950#L553-1 assume !(test_fun_#t~mem3 == 0);havoc test_fun_#t~mem3; 939#L555 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L555 940#L555-1 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 930#L558-3 [2018-10-27 06:10:24,121 INFO L795 eck$LassoCheckResult]: Loop: 930#L558-3 assume true; 922#L558 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L558 923#L558-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 933#L559 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L559 926#L559-1 test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6; 927#L560 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L560 957#L560-1 test_fun_#t~post8 := test_fun_#t~mem7; 918#L560-2 SUMMARY for call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L560-2 919#L560-3 havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 930#L558-3 [2018-10-27 06:10:24,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:24,121 INFO L82 PathProgramCache]: Analyzing trace with hash -751846368, now seen corresponding path program 1 times [2018-10-27 06:10:24,121 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:24,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:24,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:24,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:24,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:24,133 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:10:24,133 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:10:24,133 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:10:24,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:24,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:24,221 INFO L82 PathProgramCache]: Analyzing trace with hash 67643337, now seen corresponding path program 5 times [2018-10-27 06:10:24,221 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:24,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:24,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:24,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:24,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:24,223 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:10:24,224 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:10:24,224 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:10:24,240 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:10:24,247 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-27 06:10:24,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-10-27 06:10:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:24,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:24,269 INFO L82 PathProgramCache]: Analyzing trace with hash -642736502, now seen corresponding path program 2 times [2018-10-27 06:10:24,269 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:24,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:24,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:24,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:24,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:24,285 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:10:24,287 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:10:24,287 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c5a5e4d-c287-410a-aa5b-5c26ef88f1c5/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:10:24,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:10:24,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:10:24,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-10-27 06:10:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:24,728 WARN L179 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 113 [2018-10-27 06:10:24,784 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:24,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:24,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:24,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:24,784 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:24,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:24,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:24,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:24,785 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-termination.c.i_Iteration7_Lasso [2018-10-27 06:10:24,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:24,785 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:24,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,913 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2018-10-27 06:10:24,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:24,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,365 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:25,365 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:25,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:25,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:25,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:25,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:25,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:25,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:25,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:25,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:25,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:25,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:25,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:25,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:25,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:25,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:25,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:25,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:25,378 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:25,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:25,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:25,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:25,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:25,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:25,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:25,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:25,389 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:25,391 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:25,391 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:25,391 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:25,392 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:25,392 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:25,393 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-10-27 06:10:25,448 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-10-27 06:10:25,449 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:25,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:25,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:25,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:25,515 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:25,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:10:25,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2018-10-27 06:10:25,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:25,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:25,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:25,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:10:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:25,549 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:10:25,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 70 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-10-27 06:10:25,608 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 70 transitions. cyclomatic complexity: 12. Second operand 8 states. Result 79 states and 88 transitions. Complement of second has 13 states. [2018-10-27 06:10:25,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:10:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-10-27 06:10:25,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 30 letters. Loop has 9 letters. [2018-10-27 06:10:25,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:25,611 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:25,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:25,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:25,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:25,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:25,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:10:25,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2018-10-27 06:10:25,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:25,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:25,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:25,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:10:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:25,718 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:10:25,718 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 70 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-10-27 06:10:25,779 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 70 transitions. cyclomatic complexity: 12. Second operand 8 states. Result 77 states and 85 transitions. Complement of second has 15 states. [2018-10-27 06:10:25,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:10:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2018-10-27 06:10:25,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 30 letters. Loop has 9 letters. [2018-10-27 06:10:25,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:25,781 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:25,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:25,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:25,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:25,864 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:25,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:10:25,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2018-10-27 06:10:25,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:25,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:25,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:25,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-10-27 06:10:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:25,888 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:10:25,889 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 70 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-10-27 06:10:25,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 70 transitions. cyclomatic complexity: 12. Second operand 8 states. Result 99 states and 111 transitions. Complement of second has 12 states. [2018-10-27 06:10:25,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:25,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:10:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2018-10-27 06:10:25,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 30 letters. Loop has 9 letters. [2018-10-27 06:10:25,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:25,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 39 letters. Loop has 9 letters. [2018-10-27 06:10:25,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:25,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 30 letters. Loop has 18 letters. [2018-10-27 06:10:25,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:25,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 111 transitions. [2018-10-27 06:10:25,995 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:25,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 0 states and 0 transitions. [2018-10-27 06:10:25,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:10:25,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:10:25,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:10:25,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:26,000 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:26,000 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:26,000 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:26,000 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:10:26,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:10:26,000 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:26,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:10:26,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:10:26 BoogieIcfgContainer [2018-10-27 06:10:26,005 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:10:26,005 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:10:26,006 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:10:26,006 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:10:26,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:17" (3/4) ... [2018-10-27 06:10:26,010 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:10:26,010 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:10:26,011 INFO L168 Benchmark]: Toolchain (without parser) took 9918.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -136.1 MB). Peak memory consumption was 182.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:26,011 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:26,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.89 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 937.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:26,012 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 937.7 MB in the beginning and 1.2 GB in the end (delta: -231.2 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:26,012 INFO L168 Benchmark]: Boogie Preprocessor took 22.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:26,013 INFO L168 Benchmark]: RCFGBuilder took 518.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:26,013 INFO L168 Benchmark]: BuchiAutomizer took 8902.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.1 MB). Peak memory consumption was 189.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:26,014 INFO L168 Benchmark]: Witness Printer took 4.57 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:26,017 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.89 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 937.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 937.7 MB in the beginning and 1.2 GB in the end (delta: -231.2 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 518.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8902.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.1 MB). Peak memory consumption was 189.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.57 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 7.0s. Construction of modules took 0.5s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 51 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 74 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 206 SDtfs, 160 SDslu, 202 SDs, 0 SdLazy, 310 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital176 mio100 ax110 hnf99 lsp87 ukn79 mio100 lsp45 div100 bol100 ite100 ukn100 eq185 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...