./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/array16_alloca_original_false-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_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/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 b6c8e92f4d5413ae33bafe73b9024f19a73a1964 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:43:16,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:43:16,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:43:16,564 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:43:16,564 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:43:16,565 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:43:16,566 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:43:16,567 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:43:16,568 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:43:16,568 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:43:16,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:43:16,569 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:43:16,570 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:43:16,570 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:43:16,571 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:43:16,572 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:43:16,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:43:16,573 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:43:16,575 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:43:16,576 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:43:16,576 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:43:16,577 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:43:16,579 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:43:16,579 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:43:16,579 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:43:16,580 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:43:16,580 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:43:16,581 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:43:16,582 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:43:16,582 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:43:16,583 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:43:16,583 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:43:16,583 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:43:16,583 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:43:16,584 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:43:16,584 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:43:16,584 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 05:43:16,595 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:43:16,595 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:43:16,596 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:43:16,596 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:43:16,596 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:43:16,596 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:43:16,596 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:43:16,596 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:43:16,596 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:43:16,597 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:43:16,597 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:43:16,597 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:43:16,597 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:43:16,597 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:43:16,597 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:43:16,597 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:43:16,597 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:43:16,598 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:43:16,598 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:43:16,598 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:43:16,598 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:43:16,598 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:43:16,598 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:43:16,598 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:43:16,598 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:43:16,599 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:43:16,599 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:43:16,599 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:43:16,599 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_8018076e-f79d-4402-bc4c-3d9cf4fe987b/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 -> b6c8e92f4d5413ae33bafe73b9024f19a73a1964 [2018-11-10 05:43:16,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:43:16,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:43:16,634 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:43:16,635 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:43:16,636 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:43:16,636 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i [2018-11-10 05:43:16,681 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/data/fb88fc120/6b581be273a848cb9675148b68d8ee26/FLAGf1f960055 [2018-11-10 05:43:17,100 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:43:17,100 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i [2018-11-10 05:43:17,106 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/data/fb88fc120/6b581be273a848cb9675148b68d8ee26/FLAGf1f960055 [2018-11-10 05:43:17,114 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/data/fb88fc120/6b581be273a848cb9675148b68d8ee26 [2018-11-10 05:43:17,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:43:17,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:43:17,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:43:17,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:43:17,119 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:43:17,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:43:17" (1/1) ... [2018-11-10 05:43:17,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d61e1a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:17, skipping insertion in model container [2018-11-10 05:43:17,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:43:17" (1/1) ... [2018-11-10 05:43:17,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:43:17,151 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:43:17,335 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:43:17,343 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:43:17,372 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:43:17,412 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:43:17,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:17 WrapperNode [2018-11-10 05:43:17,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:43:17,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:43:17,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:43:17,413 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:43:17,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:17" (1/1) ... [2018-11-10 05:43:17,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:17" (1/1) ... [2018-11-10 05:43:17,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:43:17,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:43:17,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:43:17,487 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:43:17,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:17" (1/1) ... [2018-11-10 05:43:17,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:17" (1/1) ... [2018-11-10 05:43:17,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:17" (1/1) ... [2018-11-10 05:43:17,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:17" (1/1) ... [2018-11-10 05:43:17,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:17" (1/1) ... [2018-11-10 05:43:17,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:17" (1/1) ... [2018-11-10 05:43:17,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:17" (1/1) ... [2018-11-10 05:43:17,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:43:17,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:43:17,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:43:17,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:43:17,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/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-11-10 05:43:17,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:43:17,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:43:17,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:43:17,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:43:17,717 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:43:17,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:43:17 BoogieIcfgContainer [2018-11-10 05:43:17,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:43:17,717 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:43:17,717 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:43:17,720 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:43:17,721 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:43:17,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:43:17" (1/3) ... [2018-11-10 05:43:17,721 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17abcb61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:43:17, skipping insertion in model container [2018-11-10 05:43:17,721 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:43:17,722 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:17" (2/3) ... [2018-11-10 05:43:17,722 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17abcb61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:43:17, skipping insertion in model container [2018-11-10 05:43:17,722 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:43:17,722 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:43:17" (3/3) ... [2018-11-10 05:43:17,723 INFO L375 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original_false-termination.c.i [2018-11-10 05:43:17,765 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:43:17,765 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:43:17,765 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:43:17,765 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:43:17,765 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:43:17,765 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:43:17,766 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:43:17,766 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:43:17,766 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:43:17,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 05:43:17,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 05:43:17,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:43:17,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:43:17,802 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 05:43:17,802 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:17,802 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:43:17,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 05:43:17,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 05:43:17,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:43:17,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:43:17,805 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 05:43:17,805 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:17,812 INFO L793 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 23#L367true assume !(main_~length~0 < 1); 6#L367-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 19#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 4#L370-4true [2018-11-10 05:43:17,812 INFO L795 eck$LassoCheckResult]: Loop: 4#L370-4true assume true; 20#L370-1true assume !!(main_~i~0 < main_~length~0); 15#L371true SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 17#L371-1true havoc main_#t~nondet208; 13#L372true SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372 16#L372-1true assume !((if main_#t~mem209 < 0 && main_#t~mem209 % 2 != 0 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2) == 1);havoc main_#t~mem209; 24#L370-3true main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 4#L370-4true [2018-11-10 05:43:17,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:17,817 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-10 05:43:17,819 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:17,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:17,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:17,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:17,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:17,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:17,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1219413173, now seen corresponding path program 1 times [2018-11-10 05:43:17,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:17,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:17,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:17,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:17,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1949010195, now seen corresponding path program 1 times [2018-11-10 05:43:17,921 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:17,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:17,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:17,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:17,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:18,192 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-10 05:43:18,301 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:43:18,302 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:43:18,302 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:43:18,302 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:43:18,302 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:43:18,302 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:43:18,302 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:43:18,302 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:43:18,303 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration1_Lasso [2018-11-10 05:43:18,303 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:43:18,303 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:43:18,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:18,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:18,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:18,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:18,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:18,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:18,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:18,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:18,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:18,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:18,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:18,640 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:43:18,643 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:43:18,644 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-11-10 05:43:18,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:18,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:43:18,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:18,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:18,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:18,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:43:18,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:43:18,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:18,650 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-11-10 05:43:18,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:18,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:43:18,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:18,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:18,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:18,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:43:18,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:43:18,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:18,653 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-11-10 05:43:18,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:18,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:43:18,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:18,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:18,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:18,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:43:18,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:43:18,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:18,656 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-11-10 05:43:18,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:18,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:43:18,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:18,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:18,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:18,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:43:18,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:43:18,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:18,659 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-11-10 05:43:18,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:18,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:43:18,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:18,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:18,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:18,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:43:18,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:43:18,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:18,662 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-11-10 05:43:18,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:18,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:18,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:18,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:18,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:43:18,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:18,676 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:18,676 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-11-10 05:43:18,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:18,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:18,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:18,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:18,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:43:18,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:18,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:18,684 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-11-10 05:43:18,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:18,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:18,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:18,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:18,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:43:18,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:18,741 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:43:18,763 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 05:43:18,763 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 05:43:18,765 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:43:18,766 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:43:18,767 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:43:18,767 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-10 05:43:18,784 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 05:43:18,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:18,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:43:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:18,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:43:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:18,850 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-11-10 05:43:18,851 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 4 states. [2018-11-10 05:43:18,894 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 4 states. Result 51 states and 64 transitions. Complement of second has 7 states. [2018-11-10 05:43:18,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:43:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:43:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-10 05:43:18,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 5 letters. Loop has 7 letters. [2018-11-10 05:43:18,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:43:18,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-10 05:43:18,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:43:18,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-10 05:43:18,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:43:18,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. [2018-11-10 05:43:18,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 05:43:18,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 20 states and 25 transitions. [2018-11-10 05:43:18,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 05:43:18,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-10 05:43:18,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-10 05:43:18,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:43:18,906 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-10 05:43:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-10 05:43:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-10 05:43:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 05:43:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-11-10 05:43:18,924 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-10 05:43:18,924 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-10 05:43:18,925 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:43:18,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-11-10 05:43:18,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 05:43:18,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:43:18,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:43:18,926 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:18,926 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:43:18,926 INFO L793 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 162#L367 assume !(main_~length~0 < 1); 157#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 158#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 150#L370-4 assume true; 152#L370-1 assume !(main_~i~0 < main_~length~0); 156#L370-5 main_~j~0 := 0; 149#L378-3 [2018-11-10 05:43:18,926 INFO L795 eck$LassoCheckResult]: Loop: 149#L378-3 assume true; 154#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 155#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 148#L378-1 assume (if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 + 1;havoc main_#t~post211; 149#L378-3 [2018-11-10 05:43:18,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:18,927 INFO L82 PathProgramCache]: Analyzing trace with hash 176703706, now seen corresponding path program 1 times [2018-11-10 05:43:18,927 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:18,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:18,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:18,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:18,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:18,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:43:18,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:43:18,963 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:43:18,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:18,964 INFO L82 PathProgramCache]: Analyzing trace with hash 2222442, now seen corresponding path program 1 times [2018-11-10 05:43:18,964 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:18,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:18,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:18,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:18,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:19,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:43:19,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:43:19,032 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-10 05:43:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:43:19,057 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-10 05:43:19,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:43:19,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-10 05:43:19,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 05:43:19,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 32 transitions. [2018-11-10 05:43:19,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-10 05:43:19,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-10 05:43:19,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-11-10 05:43:19,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:43:19,061 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-10 05:43:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-11-10 05:43:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-11-10 05:43:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 05:43:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-11-10 05:43:19,063 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-10 05:43:19,063 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-10 05:43:19,063 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:43:19,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2018-11-10 05:43:19,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 05:43:19,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:43:19,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:43:19,064 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:19,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:43:19,065 INFO L793 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 219#L367 assume !(main_~length~0 < 1); 212#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 213#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 205#L370-4 assume true; 206#L370-1 assume !!(main_~i~0 < main_~length~0); 220#L371 SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 221#L371-1 havoc main_#t~nondet208; 216#L372 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372 217#L372-1 assume !((if main_#t~mem209 < 0 && main_#t~mem209 % 2 != 0 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2) == 1);havoc main_#t~mem209; 215#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 207#L370-4 assume true; 208#L370-1 assume !(main_~i~0 < main_~length~0); 211#L370-5 main_~j~0 := 0; 204#L378-3 [2018-11-10 05:43:19,065 INFO L795 eck$LassoCheckResult]: Loop: 204#L378-3 assume true; 209#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 210#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 203#L378-1 assume (if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 + 1;havoc main_#t~post211; 204#L378-3 [2018-11-10 05:43:19,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:19,065 INFO L82 PathProgramCache]: Analyzing trace with hash 700173366, now seen corresponding path program 1 times [2018-11-10 05:43:19,065 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:19,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:19,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:19,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:19,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:19,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:19,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2222442, now seen corresponding path program 2 times [2018-11-10 05:43:19,084 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:19,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:19,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:19,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:19,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:19,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:19,094 INFO L82 PathProgramCache]: Analyzing trace with hash 302158623, now seen corresponding path program 1 times [2018-11-10 05:43:19,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:19,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:19,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:19,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:43:19,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:19,276 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2018-11-10 05:43:19,465 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2018-11-10 05:43:19,466 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:43:19,466 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:43:19,466 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:43:19,466 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:43:19,466 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:43:19,466 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:43:19,466 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:43:19,466 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:43:19,467 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration3_Lasso [2018-11-10 05:43:19,467 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:43:19,467 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:43:19,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:19,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:19,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:19,724 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2018-11-10 05:43:19,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:19,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:19,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:19,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:19,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:19,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:19,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:19,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:19,978 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:43:19,978 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:43:19,978 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-11-10 05:43:19,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:19,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:43:19,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:19,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:19,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:19,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:43:19,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:43:19,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:19,981 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-11-10 05:43:19,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:19,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:43:19,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:19,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:19,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:19,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:43:19,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:43:19,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:19,983 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-11-10 05:43:19,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:19,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:19,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:19,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:19,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:43:19,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:19,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:19,991 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-11-10 05:43:19,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:19,992 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:43:19,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:19,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:19,996 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:43:19,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:20,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:20,002 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-11-10 05:43:20,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:20,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:20,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:20,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:20,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:43:20,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:20,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:20,008 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-11-10 05:43:20,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:20,009 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:43:20,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:20,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:20,011 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:43:20,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:20,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:20,014 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-11-10 05:43:20,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:20,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:20,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:20,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:20,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:43:20,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:20,031 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:43:20,046 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 05:43:20,046 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 05:43:20,046 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:43:20,047 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:43:20,047 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:43:20,048 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 - 1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-10 05:43:20,070 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 05:43:20,073 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:43:20,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:20,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:43:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:20,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:43:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:20,101 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-11-10 05:43:20,101 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-10 05:43:20,113 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 28 states and 34 transitions. Complement of second has 7 states. [2018-11-10 05:43:20,117 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-11-10 05:43:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:43:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-10 05:43:20,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-10 05:43:20,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:43:20,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-10 05:43:20,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:43:20,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-10 05:43:20,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:43:20,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions. [2018-11-10 05:43:20,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 05:43:20,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 34 transitions. [2018-11-10 05:43:20,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 05:43:20,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 05:43:20,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 34 transitions. [2018-11-10 05:43:20,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:43:20,120 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-10 05:43:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 34 transitions. [2018-11-10 05:43:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-10 05:43:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 05:43:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-10 05:43:20,122 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-10 05:43:20,122 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-10 05:43:20,123 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:43:20,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2018-11-10 05:43:20,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 05:43:20,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:43:20,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:43:20,124 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:20,124 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:43:20,124 INFO L793 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 363#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 364#L367 assume !(main_~length~0 < 1); 358#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 359#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 348#L370-4 assume true; 349#L370-1 assume !!(main_~i~0 < main_~length~0); 368#L371 SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 369#L371-1 havoc main_#t~nondet208; 365#L372 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372 366#L372-1 assume !((if main_#t~mem209 < 0 && main_#t~mem209 % 2 != 0 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2) == 1);havoc main_#t~mem209; 362#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 350#L370-4 assume true; 351#L370-1 assume !(main_~i~0 < main_~length~0); 356#L370-5 main_~j~0 := 0; 357#L378-3 assume true; 360#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 371#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 344#L378-1 assume !((if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 345#L378-3 [2018-11-10 05:43:20,124 INFO L795 eck$LassoCheckResult]: Loop: 345#L378-3 assume true; 352#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 353#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 370#L378-1 assume (if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 + 1;havoc main_#t~post211; 345#L378-3 [2018-11-10 05:43:20,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash 302158625, now seen corresponding path program 1 times [2018-11-10 05:43:20,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:20,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:20,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:20,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:20,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:20,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2222442, now seen corresponding path program 3 times [2018-11-10 05:43:20,150 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:20,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:20,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:20,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:20,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:20,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1516629130, now seen corresponding path program 1 times [2018-11-10 05:43:20,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:20,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:20,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:43:20,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:43:20,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:43:20,195 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:43:20,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:20,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:43:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:43:20,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:43:20,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-11-10 05:43:20,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:43:20,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:43:20,298 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-10 05:43:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:43:20,315 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-10 05:43:20,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:43:20,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2018-11-10 05:43:20,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 05:43:20,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 36 transitions. [2018-11-10 05:43:20,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 05:43:20,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 05:43:20,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2018-11-10 05:43:20,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:43:20,317 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-10 05:43:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2018-11-10 05:43:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-10 05:43:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 05:43:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-10 05:43:20,319 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-10 05:43:20,319 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-10 05:43:20,319 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:43:20,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-11-10 05:43:20,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 05:43:20,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:43:20,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:43:20,320 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:20,320 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:43:20,321 INFO L793 eck$LassoCheckResult]: Stem: 506#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 502#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 503#L367 assume !(main_~length~0 < 1); 496#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 497#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 488#L370-4 assume true; 489#L370-1 assume !!(main_~i~0 < main_~length~0); 507#L371 SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 508#L371-1 havoc main_#t~nondet208; 504#L372 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372 505#L372-1 assume !((if main_#t~mem209 < 0 && main_#t~mem209 % 2 != 0 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2) == 1);havoc main_#t~mem209; 501#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 490#L370-4 assume true; 491#L370-1 assume !(main_~i~0 < main_~length~0); 498#L370-5 main_~j~0 := 0; 499#L378-3 assume true; 494#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 495#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 486#L378-1 assume (if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 + 1;havoc main_#t~post211; 487#L378-3 assume true; 492#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 493#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 484#L378-1 assume !((if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 485#L378-3 [2018-11-10 05:43:20,321 INFO L795 eck$LassoCheckResult]: Loop: 485#L378-3 assume true; 511#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 510#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 509#L378-1 assume (if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 + 1;havoc main_#t~post211; 485#L378-3 [2018-11-10 05:43:20,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:20,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1514782090, now seen corresponding path program 2 times [2018-11-10 05:43:20,321 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:20,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:20,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:20,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:20,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:43:20,354 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:43:20,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 05:43:20,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 05:43:20,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:43:20,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:43:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:20,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:43:20,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-10 05:43:20,413 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:43:20,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2222442, now seen corresponding path program 4 times [2018-11-10 05:43:20,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:20,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:20,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:43:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:20,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 05:43:20,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:43:20,456 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand 10 states. [2018-11-10 05:43:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:43:20,557 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-10 05:43:20,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 05:43:20,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 81 transitions. [2018-11-10 05:43:20,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 05:43:20,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 43 states and 49 transitions. [2018-11-10 05:43:20,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 05:43:20,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 05:43:20,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 49 transitions. [2018-11-10 05:43:20,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:43:20,560 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-10 05:43:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 49 transitions. [2018-11-10 05:43:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-11-10 05:43:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 05:43:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-10 05:43:20,563 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-10 05:43:20,563 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-10 05:43:20,563 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 05:43:20,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2018-11-10 05:43:20,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 05:43:20,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:43:20,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:43:20,564 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:20,564 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:43:20,564 INFO L793 eck$LassoCheckResult]: Stem: 697#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 691#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 692#L367 assume !(main_~length~0 < 1); 686#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 687#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 676#L370-4 assume true; 677#L370-1 assume !!(main_~i~0 < main_~length~0); 706#L371 SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 705#L371-1 havoc main_#t~nondet208; 704#L372 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372 702#L372-1 assume !((if main_#t~mem209 < 0 && main_#t~mem209 % 2 != 0 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2) == 1);havoc main_#t~mem209; 701#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 678#L370-4 assume true; 679#L370-1 assume !!(main_~i~0 < main_~length~0); 695#L371 SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 696#L371-1 havoc main_#t~nondet208; 693#L372 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372 694#L372-1 assume !((if main_#t~mem209 < 0 && main_#t~mem209 % 2 != 0 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2) == 1);havoc main_#t~mem209; 690#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 700#L370-4 assume true; 698#L370-1 assume !(main_~i~0 < main_~length~0); 684#L370-5 main_~j~0 := 0; 685#L378-3 assume true; 682#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 683#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 674#L378-1 assume (if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 + 1;havoc main_#t~post211; 675#L378-3 assume true; 688#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 707#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 672#L378-1 assume !((if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 673#L378-3 [2018-11-10 05:43:20,564 INFO L795 eck$LassoCheckResult]: Loop: 673#L378-3 assume true; 680#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 681#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 699#L378-1 assume (if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 + 1;havoc main_#t~post211; 673#L378-3 [2018-11-10 05:43:20,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:20,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1135318702, now seen corresponding path program 3 times [2018-11-10 05:43:20,565 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:20,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:20,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:43:20,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:20,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2222442, now seen corresponding path program 5 times [2018-11-10 05:43:20,602 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:20,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:43:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:20,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:20,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1046978153, now seen corresponding path program 4 times [2018-11-10 05:43:20,608 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:20,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:20,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:43:20,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:21,025 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 125 [2018-11-10 05:43:21,300 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 75 [2018-11-10 05:43:21,301 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:43:21,302 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:43:21,302 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:43:21,302 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:43:21,302 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:43:21,302 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:43:21,302 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:43:21,302 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:43:21,302 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration6_Lasso [2018-11-10 05:43:21,302 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:43:21,302 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:43:21,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-11-10 05:43:21,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-11-10 05:43:21,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:21,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:21,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:21,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:21,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:21,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:21,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:21,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:21,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:43:21,692 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:43:21,692 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:43:21,692 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-11-10 05:43:21,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:21,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:43:21,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:21,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:21,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:21,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:43:21,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:43:21,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:21,694 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-11-10 05:43:21,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:21,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:43:21,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:21,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:21,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:21,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:43:21,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:43:21,696 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:21,696 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-11-10 05:43:21,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:21,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:21,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:21,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:21,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:43:21,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:21,698 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:21,698 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-11-10 05:43:21,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:21,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:43:21,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:21,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:21,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:21,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:43:21,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:43:21,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:21,699 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-11-10 05:43:21,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:21,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:43:21,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:21,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:21,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:21,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:43:21,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:43:21,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:21,700 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-11-10 05:43:21,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:21,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:43:21,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:21,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:21,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:21,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:43:21,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:43:21,701 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:21,702 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-11-10 05:43:21,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:21,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:21,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:21,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:21,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:43:21,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:21,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:21,705 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-11-10 05:43:21,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:21,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:21,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:21,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:21,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:43:21,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:21,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:21,708 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-11-10 05:43:21,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:21,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:21,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:21,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:21,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:43:21,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:21,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:21,713 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-11-10 05:43:21,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:21,713 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:43:21,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:21,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:21,715 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:43:21,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:21,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:21,719 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-11-10 05:43:21,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:21,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:21,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:21,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:21,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:43:21,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:21,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:43:21,722 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-11-10 05:43:21,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:43:21,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:43:21,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:43:21,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:43:21,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:43:21,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:43:21,733 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:43:21,741 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 05:43:21,742 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 05:43:21,742 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:43:21,743 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:43:21,743 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:43:21,743 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-10 05:43:21,751 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 05:43:21,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:21,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:43:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:21,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:43:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:21,809 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-11-10 05:43:21,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 05:43:21,824 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 44 states and 51 transitions. Complement of second has 7 states. [2018-11-10 05:43:21,826 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-11-10 05:43:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:43:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-10 05:43:21,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 30 letters. Loop has 4 letters. [2018-11-10 05:43:21,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:43:21,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 34 letters. Loop has 4 letters. [2018-11-10 05:43:21,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:43:21,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 30 letters. Loop has 8 letters. [2018-11-10 05:43:21,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:43:21,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 51 transitions. [2018-11-10 05:43:21,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 05:43:21,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 51 transitions. [2018-11-10 05:43:21,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 05:43:21,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 05:43:21,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 51 transitions. [2018-11-10 05:43:21,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:43:21,829 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-10 05:43:21,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 51 transitions. [2018-11-10 05:43:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-10 05:43:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 05:43:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-10 05:43:21,831 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-10 05:43:21,831 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-10 05:43:21,831 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 05:43:21,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2018-11-10 05:43:21,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 05:43:21,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:43:21,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:43:21,833 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:21,833 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:43:21,833 INFO L793 eck$LassoCheckResult]: Stem: 918#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 914#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 915#L367 assume !(main_~length~0 < 1); 906#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 907#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 898#L370-4 assume true; 899#L370-1 assume !!(main_~i~0 < main_~length~0); 919#L371 SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 920#L371-1 havoc main_#t~nondet208; 916#L372 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372 917#L372-1 assume !((if main_#t~mem209 < 0 && main_#t~mem209 % 2 != 0 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2) == 1);havoc main_#t~mem209; 913#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 900#L370-4 assume true; 901#L370-1 assume !!(main_~i~0 < main_~length~0); 922#L371 SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 928#L371-1 havoc main_#t~nondet208; 927#L372 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372 925#L372-1 assume !((if main_#t~mem209 < 0 && main_#t~mem209 % 2 != 0 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2) == 1);havoc main_#t~mem209; 924#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 923#L370-4 assume true; 921#L370-1 assume !(main_~i~0 < main_~length~0); 908#L370-5 main_~j~0 := 0; 909#L378-3 assume true; 904#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 905#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 896#L378-1 assume (if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 + 1;havoc main_#t~post211; 897#L378-3 assume true; 902#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 903#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 894#L378-1 assume !((if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 895#L378-3 assume true; 933#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 932#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 930#L378-1 assume !((if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 910#L378-3 [2018-11-10 05:43:21,833 INFO L795 eck$LassoCheckResult]: Loop: 910#L378-3 assume true; 911#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 931#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 929#L378-1 assume (if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 + 1;havoc main_#t~post211; 910#L378-3 [2018-11-10 05:43:21,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:21,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1046978151, now seen corresponding path program 5 times [2018-11-10 05:43:21,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:21,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:21,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:21,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:43:21,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:43:22,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:43:22,154 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:43:22,164 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 05:43:22,178 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-11-10 05:43:22,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:43:22,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:43:22,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 12 [2018-11-10 05:43:22,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 05:43:22,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:43:22,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:43:22,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:43:22,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 05:43:22,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 12 [2018-11-10 05:43:22,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 05:43:22,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:43:22,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:43:22,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:43:22,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-11-10 05:43:22,287 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 17 treesize of output 13 [2018-11-10 05:43:22,289 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 05:43:22,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:43:22,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:43:22,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:43:22,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 05:43:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:22,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:43:22,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-11-10 05:43:22,315 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:43:22,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2222442, now seen corresponding path program 6 times [2018-11-10 05:43:22,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:22,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:22,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:43:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:22,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 05:43:22,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-11-10 05:43:22,361 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand 16 states. [2018-11-10 05:43:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:43:22,490 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-11-10 05:43:22,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:43:22,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 86 transitions. [2018-11-10 05:43:22,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 05:43:22,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 73 states and 83 transitions. [2018-11-10 05:43:22,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-10 05:43:22,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-10 05:43:22,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 83 transitions. [2018-11-10 05:43:22,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:43:22,493 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 83 transitions. [2018-11-10 05:43:22,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 83 transitions. [2018-11-10 05:43:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2018-11-10 05:43:22,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 05:43:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2018-11-10 05:43:22,497 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 77 transitions. [2018-11-10 05:43:22,497 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 77 transitions. [2018-11-10 05:43:22,498 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 05:43:22,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 77 transitions. [2018-11-10 05:43:22,498 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 05:43:22,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:43:22,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:43:22,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:22,499 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:43:22,499 INFO L793 eck$LassoCheckResult]: Stem: 1166#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1162#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 1163#L367 assume !(main_~length~0 < 1); 1154#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 1155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 1146#L370-4 assume true; 1147#L370-1 assume !!(main_~i~0 < main_~length~0); 1167#L371 SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 1168#L371-1 havoc main_#t~nondet208; 1164#L372 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372 1165#L372-1 assume !((if main_#t~mem209 < 0 && main_#t~mem209 % 2 != 0 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2) == 1);havoc main_#t~mem209; 1161#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 1148#L370-4 assume true; 1149#L370-1 assume !!(main_~i~0 < main_~length~0); 1170#L371 SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 1178#L371-1 havoc main_#t~nondet208; 1177#L372 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372 1175#L372-1 assume !((if main_#t~mem209 < 0 && main_#t~mem209 % 2 != 0 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2) == 1);havoc main_#t~mem209; 1174#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 1173#L370-4 assume true; 1169#L370-1 assume !(main_~i~0 < main_~length~0); 1156#L370-5 main_~j~0 := 0; 1157#L378-3 assume true; 1158#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 1208#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 1144#L378-1 assume (if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 + 1;havoc main_#t~post211; 1145#L378-3 assume true; 1159#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 1171#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 1172#L378-1 assume (if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 + 1;havoc main_#t~post211; 1207#L378-3 assume true; 1205#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 1203#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 1201#L378-1 assume !((if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 1198#L378-3 assume true; 1195#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 1193#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 1192#L378-1 assume !((if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 1182#L378-3 [2018-11-10 05:43:22,499 INFO L795 eck$LassoCheckResult]: Loop: 1182#L378-3 assume true; 1190#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 1188#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 1181#L378-1 assume (if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 + 1;havoc main_#t~post211; 1182#L378-3 [2018-11-10 05:43:22,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:22,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1819730178, now seen corresponding path program 6 times [2018-11-10 05:43:22,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:22,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:22,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:43:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:43:22,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:43:22,560 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:43:22,573 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 05:43:22,593 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-10 05:43:22,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:43:22,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:43:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:43:22,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:43:22,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-10 05:43:22,646 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:43:22,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:22,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2222442, now seen corresponding path program 7 times [2018-11-10 05:43:22,647 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:22,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:22,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:22,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:43:22,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:22,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 05:43:22,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:43:22,689 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. cyclomatic complexity: 15 Second operand 13 states. [2018-11-10 05:43:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:43:22,777 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2018-11-10 05:43:22,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:43:22,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 135 transitions. [2018-11-10 05:43:22,779 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2018-11-10 05:43:22,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 108 states and 121 transitions. [2018-11-10 05:43:22,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-10 05:43:22,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-10 05:43:22,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 121 transitions. [2018-11-10 05:43:22,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:43:22,781 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 121 transitions. [2018-11-10 05:43:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 121 transitions. [2018-11-10 05:43:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 85. [2018-11-10 05:43:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 05:43:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2018-11-10 05:43:22,785 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 97 transitions. [2018-11-10 05:43:22,785 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 97 transitions. [2018-11-10 05:43:22,785 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 05:43:22,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 97 transitions. [2018-11-10 05:43:22,786 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2018-11-10 05:43:22,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:43:22,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:43:22,787 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:43:22,787 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2018-11-10 05:43:22,787 INFO L793 eck$LassoCheckResult]: Stem: 1490#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1486#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 1487#L367 assume !(main_~length~0 < 1); 1478#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 1479#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 1470#L370-4 assume true; 1471#L370-1 assume !!(main_~i~0 < main_~length~0); 1504#L371 SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 1503#L371-1 havoc main_#t~nondet208; 1502#L372 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372 1500#L372-1 assume !((if main_#t~mem209 < 0 && main_#t~mem209 % 2 != 0 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2) == 1);havoc main_#t~mem209; 1499#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 1472#L370-4 assume true; 1473#L370-1 assume !!(main_~i~0 < main_~length~0); 1516#L371 SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 1515#L371-1 havoc main_#t~nondet208; 1514#L372 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372 1512#L372-1 assume !((if main_#t~mem209 < 0 && main_#t~mem209 % 2 != 0 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2) == 1);havoc main_#t~mem209; 1511#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 1510#L370-4 assume true; 1509#L370-1 assume !(main_~i~0 < main_~length~0); 1480#L370-5 main_~j~0 := 0; 1467#L378-3 [2018-11-10 05:43:22,787 INFO L795 eck$LassoCheckResult]: Loop: 1467#L378-3 assume true; 1550#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 1549#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 1525#L378-1 assume (if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 + 1;havoc main_#t~post211; 1481#L378-3 assume true; 1474#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 1475#L378 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L378 1466#L378-1 assume !((if main_#t~mem210 < 0 && main_#t~mem210 % 2 != 0 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) == 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 1467#L378-3 [2018-11-10 05:43:22,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:22,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1442117286, now seen corresponding path program 2 times [2018-11-10 05:43:22,788 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:22,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:22,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:22,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:22,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:22,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:22,796 INFO L82 PathProgramCache]: Analyzing trace with hash -521210283, now seen corresponding path program 1 times [2018-11-10 05:43:22,796 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:22,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:22,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:22,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:43:22,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:22,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:22,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1135318702, now seen corresponding path program 7 times [2018-11-10 05:43:22,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:43:22,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:43:22,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:22,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:43:22,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:43:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:43:23,052 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2018-11-10 05:43:23,471 WARN L179 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2018-11-10 05:43:23,491 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:43:23,491 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:43:23,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:43:23 BoogieIcfgContainer [2018-11-10 05:43:23,505 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:43:23,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:43:23,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:43:23,505 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:43:23,506 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:43:17" (3/4) ... [2018-11-10 05:43:23,510 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 05:43:23,548 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8018076e-f79d-4402-bc4c-3d9cf4fe987b/bin-2019/uautomizer/witness.graphml [2018-11-10 05:43:23,548 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:43:23,550 INFO L168 Benchmark]: Toolchain (without parser) took 6434.18 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.8 MB). Free memory was 957.1 MB in the beginning and 1.3 GB in the end (delta: -307.1 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:43:23,551 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:43:23,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.23 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 930.1 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-11-10 05:43:23,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 930.1 MB in the beginning and 1.1 GB in the end (delta: -204.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:43:23,552 INFO L168 Benchmark]: Boogie Preprocessor took 16.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:43:23,552 INFO L168 Benchmark]: RCFGBuilder took 213.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:43:23,553 INFO L168 Benchmark]: BuchiAutomizer took 5787.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -150.0 MB). Peak memory consumption was 461.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:43:23,553 INFO L168 Benchmark]: Witness Printer took 43.39 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-10 05:43:23,556 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 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.23 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 930.1 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 930.1 MB in the beginning and 1.1 GB in the end (delta: -204.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 213.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5787.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -150.0 MB). Peak memory consumption was 461.8 MB. Max. memory is 11.5 GB. * Witness Printer took 43.39 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (5 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[arr] + -1 * arr + -4 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * j + length and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 16 locations. The remainder module has 85 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 9 iterations. TraceHistogramMax:4. Analysis of lassos took 5.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 46 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 85 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 134 SDtfs, 240 SDslu, 239 SDs, 0 SdLazy, 434 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital196 mio100 ax100 hnf99 lsp76 ukn104 mio100 lsp46 div146 bol100 ite100 ukn100 eq156 hnf69 smp93 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. [2018-11-10 05:43:23,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:43:23,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:43:23,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:43:23,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {NULL=0, \result=0, arr=5, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5df65482=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61f5ed7d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@574b79da=0, length=2, j=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@79d9f5c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@574b79da=5, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@6bca8677=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@3e0e4bcf=0, NULL=8, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@8cf7340=0, NULL=5, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@65dd60c1=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] EXPR, FCALL __builtin_alloca(length*sizeof(int)) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i