./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/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_b5906686-27af-4106-9d4f-1b75b578da02/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/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-5842f4b [2018-11-18 12:18:49,615 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:18:49,616 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:18:49,623 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:18:49,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:18:49,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:18:49,625 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:18:49,626 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:18:49,627 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:18:49,628 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:18:49,628 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:18:49,628 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:18:49,629 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:18:49,629 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:18:49,630 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:18:49,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:18:49,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:18:49,632 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:18:49,633 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:18:49,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:18:49,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:18:49,636 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:18:49,638 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:18:49,638 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:18:49,638 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:18:49,639 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:18:49,640 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:18:49,640 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:18:49,641 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:18:49,642 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:18:49,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:18:49,642 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:18:49,643 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:18:49,643 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:18:49,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:18:49,644 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:18:49,644 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:18:49,655 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:18:49,655 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:18:49,656 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:18:49,656 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:18:49,657 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:18:49,657 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:18:49,657 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:18:49,657 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:18:49,657 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:18:49,657 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:18:49,657 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:18:49,658 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:18:49,658 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:18:49,658 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:18:49,658 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:18:49,658 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:18:49,658 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:18:49,658 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:18:49,658 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:18:49,659 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:18:49,659 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:18:49,659 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:18:49,659 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:18:49,659 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:18:49,659 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:18:49,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:18:49,660 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:18:49,660 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:18:49,660 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:18:49,661 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_b5906686-27af-4106-9d4f-1b75b578da02/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-18 12:18:49,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:18:49,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:18:49,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:18:49,697 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:18:49,697 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:18:49,698 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i [2018-11-18 12:18:49,742 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/bin-2019/uautomizer/data/5d1531b81/6e691baf5b484cb2a366ce6d5a31f739/FLAGca004b05b [2018-11-18 12:18:50,185 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:18:50,185 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i [2018-11-18 12:18:50,192 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/bin-2019/uautomizer/data/5d1531b81/6e691baf5b484cb2a366ce6d5a31f739/FLAGca004b05b [2018-11-18 12:18:50,202 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/bin-2019/uautomizer/data/5d1531b81/6e691baf5b484cb2a366ce6d5a31f739 [2018-11-18 12:18:50,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:18:50,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:18:50,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:18:50,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:18:50,208 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:18:50,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:18:50" (1/1) ... [2018-11-18 12:18:50,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ccd6627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:50, skipping insertion in model container [2018-11-18 12:18:50,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:18:50" (1/1) ... [2018-11-18 12:18:50,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:18:50,240 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:18:50,443 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:18:50,449 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:18:50,538 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:18:50,566 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:18:50,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:50 WrapperNode [2018-11-18 12:18:50,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:18:50,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:18:50,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:18:50,567 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:18:50,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:50" (1/1) ... [2018-11-18 12:18:50,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:50" (1/1) ... [2018-11-18 12:18:50,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:18:50,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:18:50,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:18:50,593 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:18:50,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:50" (1/1) ... [2018-11-18 12:18:50,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:50" (1/1) ... [2018-11-18 12:18:50,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:50" (1/1) ... [2018-11-18 12:18:50,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:50" (1/1) ... [2018-11-18 12:18:50,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:50" (1/1) ... [2018-11-18 12:18:50,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:50" (1/1) ... [2018-11-18 12:18:50,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:50" (1/1) ... [2018-11-18 12:18:50,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:18:50,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:18:50,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:18:50,608 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:18:50,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/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-18 12:18:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:18:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:18:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:18:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:18:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:18:50,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:18:50,764 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:18:50,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:18:50 BoogieIcfgContainer [2018-11-18 12:18:50,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:18:50,765 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:18:50,765 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:18:50,767 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:18:50,768 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:18:50,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:18:50" (1/3) ... [2018-11-18 12:18:50,769 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@111281ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:18:50, skipping insertion in model container [2018-11-18 12:18:50,769 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:18:50,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:18:50" (2/3) ... [2018-11-18 12:18:50,769 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@111281ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:18:50, skipping insertion in model container [2018-11-18 12:18:50,769 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:18:50,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:18:50" (3/3) ... [2018-11-18 12:18:50,771 INFO L375 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original_false-termination.c.i [2018-11-18 12:18:50,814 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:18:50,814 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:18:50,815 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:18:50,815 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:18:50,815 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:18:50,815 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:18:50,815 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:18:50,815 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:18:50,815 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:18:50,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-18 12:18:50,842 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 12:18:50,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:50,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:50,848 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 12:18:50,848 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:18:50,848 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:18:50,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-18 12:18:50,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 12:18:50,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:50,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:50,850 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 12:18:50,850 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:18:50,857 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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; 18#L367true assume !(main_~length~0 < 1); 6#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 14#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 3#L370-4true [2018-11-18 12:18:50,857 INFO L796 eck$LassoCheckResult]: Loop: 3#L370-4true assume true; 15#L370-1true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 11#L372true assume 1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2);havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 19#L370-3true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 3#L370-4true [2018-11-18 12:18:50,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:50,861 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-18 12:18:50,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:50,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:50,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:50,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:50,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:50,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:50,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1482698, now seen corresponding path program 1 times [2018-11-18 12:18:50,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:50,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:50,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:50,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:50,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:50,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:50,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1182849170, now seen corresponding path program 1 times [2018-11-18 12:18:50,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:50,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:50,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:50,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:50,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:51,227 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:18:51,228 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:18:51,228 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:18:51,228 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:18:51,228 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:18:51,228 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:18:51,228 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:18:51,228 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:18:51,229 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration1_Lasso [2018-11-18 12:18:51,229 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:18:51,229 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:18:51,250 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-18 12:18:51,254 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-18 12:18:51,256 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-18 12:18:51,258 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-18 12:18:51,259 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-18 12:18:51,260 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-18 12:18:51,263 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-18 12:18:51,342 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-18 12:18:51,343 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-18 12:18:51,345 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-18 12:18:51,347 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-18 12:18:51,349 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-18 12:18:51,514 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:18:51,518 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:18:51,520 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-18 12:18:51,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:51,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:51,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:51,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:51,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:51,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:51,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:51,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:51,527 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-18 12:18:51,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:51,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:51,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:51,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:51,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:51,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:51,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:51,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:51,530 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-18 12:18:51,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:51,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:51,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:51,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:51,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:51,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:51,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:51,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:51,532 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-18 12:18:51,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:51,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:51,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:51,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:51,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:51,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:51,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:51,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:51,534 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-18 12:18:51,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:51,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:51,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:51,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:51,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:51,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:51,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:51,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:51,537 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-18 12:18:51,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:51,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:51,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:51,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:51,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:51,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:51,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:51,544 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-18 12:18:51,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:51,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:51,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:51,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:51,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:51,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:51,586 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:18:51,610 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 12:18:51,610 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 12:18:51,612 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:18:51,613 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:18:51,614 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:18:51,614 INFO L520 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-18 12:18:51,629 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 12:18:51,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:51,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:51,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:51,695 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-18 12:18:51,705 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-18 12:18:51,706 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-11-18 12:18:51,744 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 40 states and 53 transitions. Complement of second has 7 states. [2018-11-18 12:18:51,744 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-18 12:18:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:18:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-18 12:18:51,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-18 12:18:51,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:51,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-18 12:18:51,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:51,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-18 12:18:51,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:51,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2018-11-18 12:18:51,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:18:51,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 15 states and 20 transitions. [2018-11-18 12:18:51,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 12:18:51,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 12:18:51,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-11-18 12:18:51,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:18:51,757 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-18 12:18:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-11-18 12:18:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 12:18:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 12:18:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-18 12:18:51,778 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-18 12:18:51,778 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-18 12:18:51,778 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:18:51,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-18 12:18:51,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:18:51,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:51,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:51,779 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:18:51,779 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:18:51,779 INFO L794 eck$LassoCheckResult]: Stem: 137#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 135#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; 136#L367 assume !(main_~length~0 < 1); 131#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 132#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-4 assume true; 125#L370-1 assume !(main_~i~0 < main_~length~0); 130#L370-5 main_~j~0 := 0; 127#L378-2 [2018-11-18 12:18:51,779 INFO L796 eck$LassoCheckResult]: Loop: 127#L378-2 assume true; 128#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 129#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 127#L378-2 [2018-11-18 12:18:51,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash 176703702, now seen corresponding path program 1 times [2018-11-18 12:18:51,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:51,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:51,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:51,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:51,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:51,816 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-18 12:18:51,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:18:51,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:18:51,819 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:18:51,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:51,819 INFO L82 PathProgramCache]: Analyzing trace with hash 67722, now seen corresponding path program 1 times [2018-11-18 12:18:51,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:51,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:51,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:51,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:51,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:51,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:18:51,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:18:51,895 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 12:18:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:18:51,922 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-11-18 12:18:51,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:18:51,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-11-18 12:18:51,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:18:51,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 23 transitions. [2018-11-18 12:18:51,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:18:51,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 12:18:51,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-11-18 12:18:51,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:18:51,925 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-18 12:18:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-11-18 12:18:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-11-18 12:18:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 12:18:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-18 12:18:51,926 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 12:18:51,927 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 12:18:51,927 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:18:51,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-18 12:18:51,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:18:51,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:51,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:51,928 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:18:51,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:18:51,928 INFO L794 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#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; 175#L367 assume !(main_~length~0 < 1); 171#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 172#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 164#L370-4 assume true; 165#L370-1 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 176#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 177#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 166#L370-4 assume true; 167#L370-1 assume !(main_~i~0 < main_~length~0); 173#L370-5 main_~j~0 := 0; 168#L378-2 [2018-11-18 12:18:51,928 INFO L796 eck$LassoCheckResult]: Loop: 168#L378-2 assume true; 169#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 170#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 168#L378-2 [2018-11-18 12:18:51,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:51,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1945175185, now seen corresponding path program 1 times [2018-11-18 12:18:51,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:51,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:51,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:51,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:51,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:51,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:51,949 INFO L82 PathProgramCache]: Analyzing trace with hash 67722, now seen corresponding path program 2 times [2018-11-18 12:18:51,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:51,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:51,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:51,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:51,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:51,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:51,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1015140772, now seen corresponding path program 1 times [2018-11-18 12:18:51,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:51,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:51,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:51,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:18:51,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:52,326 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-11-18 12:18:52,328 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:18:52,328 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:18:52,328 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:18:52,328 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:18:52,328 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:18:52,328 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:18:52,328 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:18:52,328 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:18:52,328 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration3_Lasso [2018-11-18 12:18:52,328 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:18:52,329 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:18:52,332 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-18 12:18:52,335 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-18 12:18:52,336 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-18 12:18:52,338 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-18 12:18:52,339 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-18 12:18:52,340 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-18 12:18:52,342 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-18 12:18:52,342 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-18 12:18:52,343 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-18 12:18:52,344 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-18 12:18:52,492 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-11-18 12:18:52,507 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-18 12:18:52,509 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-18 12:18:52,734 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:18:52,734 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:18:52,735 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-18 12:18:52,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:52,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:52,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:52,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:52,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:52,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:52,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:52,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:52,737 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-18 12:18:52,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:52,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:52,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:52,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:52,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:52,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:52,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:52,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:52,740 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-18 12:18:52,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:52,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:52,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:52,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:52,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:52,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:52,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:52,743 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-18 12:18:52,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:52,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:52,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:52,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:52,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:52,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:52,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:52,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:52,745 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-18 12:18:52,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:52,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:52,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:52,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:52,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:52,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:52,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:52,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:52,747 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-18 12:18:52,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:52,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:52,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:52,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:52,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:52,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:52,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:52,750 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-18 12:18:52,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:52,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:52,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:52,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:52,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:52,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:52,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:52,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:52,752 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-18 12:18:52,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:52,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:52,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:52,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:52,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:52,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:52,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:52,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:52,754 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-18 12:18:52,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:52,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:52,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:52,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:52,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:52,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:52,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:52,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:52,756 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-18 12:18:52,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:52,756 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:18:52,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:52,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:52,758 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:18:52,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:52,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:52,761 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-18 12:18:52,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:52,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:52,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:52,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:52,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:52,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:52,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:52,764 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-18 12:18:52,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:52,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:52,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:52,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:52,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:52,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:52,783 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:18:52,794 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 12:18:52,794 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 12:18:52,794 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:18:52,795 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:18:52,795 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:18:52,796 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2018-11-18 12:18:52,822 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 12:18:52,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:52,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:52,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:52,853 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-18 12:18:52,853 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-18 12:18:52,853 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 12:18:52,865 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 27 transitions. Complement of second has 7 states. [2018-11-18 12:18:52,865 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-18 12:18:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:18:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-18 12:18:52,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 12:18:52,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:52,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-18 12:18:52,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:52,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 12:18:52,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:52,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2018-11-18 12:18:52,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:18:52,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 27 transitions. [2018-11-18 12:18:52,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 12:18:52,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 12:18:52,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-11-18 12:18:52,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:18:52,869 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-18 12:18:52,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-11-18 12:18:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-18 12:18:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 12:18:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-11-18 12:18:52,870 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-18 12:18:52,870 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-18 12:18:52,870 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:18:52,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2018-11-18 12:18:52,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:18:52,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:52,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:52,871 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:18:52,871 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:18:52,871 INFO L794 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 298#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; 299#L367 assume !(main_~length~0 < 1); 294#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 295#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 281#L370-4 assume true; 282#L370-1 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 296#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 297#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 283#L370-4 assume true; 284#L370-1 assume !(main_~i~0 < main_~length~0); 292#L370-5 main_~j~0 := 0; 293#L378-2 assume true; 289#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 301#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 285#L378-2 [2018-11-18 12:18:52,871 INFO L796 eck$LassoCheckResult]: Loop: 285#L378-2 assume true; 286#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 290#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 285#L378-2 [2018-11-18 12:18:52,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:52,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1015140774, now seen corresponding path program 1 times [2018-11-18 12:18:52,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:52,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:52,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:52,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:52,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:52,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:52,890 INFO L82 PathProgramCache]: Analyzing trace with hash 67722, now seen corresponding path program 3 times [2018-11-18 12:18:52,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:52,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:52,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:52,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:52,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:52,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:52,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1194029167, now seen corresponding path program 1 times [2018-11-18 12:18:52,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:52,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:52,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:52,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:18:52,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:18:52,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:18:52,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/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-18 12:18:52,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:52,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:53,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:18:53,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:18:53,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-18 12:18:53,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:18:53,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:18:53,070 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-11-18 12:18:53,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:18:53,142 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-18 12:18:53,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 12:18:53,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. [2018-11-18 12:18:53,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:18:53,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 28 states and 35 transitions. [2018-11-18 12:18:53,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 12:18:53,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 12:18:53,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-11-18 12:18:53,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:18:53,145 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-18 12:18:53,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-11-18 12:18:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-18 12:18:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 12:18:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-11-18 12:18:53,147 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-18 12:18:53,147 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-18 12:18:53,147 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:18:53,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2018-11-18 12:18:53,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:18:53,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:53,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:53,148 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:18:53,148 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:18:53,148 INFO L794 eck$LassoCheckResult]: Stem: 448#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 446#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; 447#L367 assume !(main_~length~0 < 1); 442#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 443#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 429#L370-4 assume true; 430#L370-1 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 453#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 452#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 431#L370-4 assume true; 432#L370-1 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 444#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 445#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 450#L370-4 assume true; 449#L370-1 assume !(main_~i~0 < main_~length~0); 440#L370-5 main_~j~0 := 0; 441#L378-2 assume true; 437#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 438#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 433#L378-2 [2018-11-18 12:18:53,149 INFO L796 eck$LassoCheckResult]: Loop: 433#L378-2 assume true; 434#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 451#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 433#L378-2 [2018-11-18 12:18:53,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:53,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1174343073, now seen corresponding path program 2 times [2018-11-18 12:18:53,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:53,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:53,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:53,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:53,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:53,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:53,178 INFO L82 PathProgramCache]: Analyzing trace with hash 67722, now seen corresponding path program 4 times [2018-11-18 12:18:53,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:53,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:53,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:53,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:18:53,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:53,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:53,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1949067542, now seen corresponding path program 2 times [2018-11-18 12:18:53,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:53,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:53,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:53,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:18:53,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:53,413 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 98 [2018-11-18 12:18:53,594 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2018-11-18 12:18:53,595 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:18:53,595 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:18:53,595 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:18:53,595 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:18:53,595 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:18:53,595 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:18:53,595 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:18:53,596 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:18:53,596 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration5_Lasso [2018-11-18 12:18:53,596 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:18:53,596 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:18:53,598 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-18 12:18:53,600 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-18 12:18:53,728 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-11-18 12:18:53,744 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-18 12:18:53,746 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-18 12:18:53,747 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-18 12:18:53,748 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-18 12:18:53,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-18 12:18:53,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-18 12:18:53,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-18 12:18:53,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-18 12:18:53,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-18 12:18:53,931 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:18:53,931 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:18:53,931 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-18 12:18:53,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:53,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:18:53,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:53,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:53,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:53,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:18:53,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:18:53,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:53,935 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-18 12:18:53,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:53,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:53,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:53,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:53,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:53,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:53,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:53,939 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-18 12:18:53,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:53,939 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:18:53,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:53,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:53,941 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:18:53,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:53,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:53,947 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-18 12:18:53,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:53,947 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:18:53,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:53,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:53,949 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:18:53,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:53,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:18:53,953 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-18 12:18:53,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:18:53,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:18:53,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:18:53,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:18:53,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:18:53,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:18:53,970 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:18:53,988 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 12:18:53,989 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 12:18:53,989 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:18:53,990 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:18:53,991 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:18:53,991 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2018-11-18 12:18:54,021 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 12:18:54,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:54,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:54,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:54,088 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-18 12:18:54,088 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-18 12:18:54,088 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-18 12:18:54,097 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2018-11-18 12:18:54,097 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-18 12:18:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:18:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 12:18:54,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-18 12:18:54,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:54,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-18 12:18:54,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:54,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-18 12:18:54,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:18:54,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2018-11-18 12:18:54,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:18:54,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 39 transitions. [2018-11-18 12:18:54,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 12:18:54,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 12:18:54,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2018-11-18 12:18:54,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:18:54,101 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 12:18:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2018-11-18 12:18:54,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 12:18:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 12:18:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-18 12:18:54,103 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 12:18:54,103 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 12:18:54,103 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:18:54,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2018-11-18 12:18:54,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:18:54,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:54,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:54,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:18:54,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:18:54,105 INFO L794 eck$LassoCheckResult]: Stem: 611#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 607#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; 608#L367 assume !(main_~length~0 < 1); 603#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 604#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 591#L370-4 assume true; 592#L370-1 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 609#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 610#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 593#L370-4 assume true; 594#L370-1 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 616#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 615#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 614#L370-4 assume true; 612#L370-1 assume !(main_~i~0 < main_~length~0); 605#L370-5 main_~j~0 := 0; 606#L378-2 assume true; 619#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 618#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 617#L378-2 assume true; 595#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 596#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 599#L378-2 [2018-11-18 12:18:54,105 INFO L796 eck$LassoCheckResult]: Loop: 599#L378-2 assume true; 600#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 620#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 599#L378-2 [2018-11-18 12:18:54,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:54,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1949067544, now seen corresponding path program 3 times [2018-11-18 12:18:54,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:54,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:54,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:54,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:18:54,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:54,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:54,135 INFO L82 PathProgramCache]: Analyzing trace with hash 67722, now seen corresponding path program 5 times [2018-11-18 12:18:54,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:54,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:54,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:54,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:18:54,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:54,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:54,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1008290749, now seen corresponding path program 3 times [2018-11-18 12:18:54,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:54,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:54,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:54,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:18:54,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:18:54,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:18:54,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/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-18 12:18:54,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 12:18:54,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 12:18:54,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:18:54,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:18:54,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:18:54,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-18 12:18:54,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 12:18:54,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:18:54,348 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-11-18 12:18:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:18:54,428 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2018-11-18 12:18:54,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:18:54,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 88 transitions. [2018-11-18 12:18:54,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-18 12:18:54,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 67 states and 83 transitions. [2018-11-18 12:18:54,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-18 12:18:54,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-18 12:18:54,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 83 transitions. [2018-11-18 12:18:54,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:18:54,432 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2018-11-18 12:18:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 83 transitions. [2018-11-18 12:18:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-11-18 12:18:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 12:18:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2018-11-18 12:18:54,437 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 69 transitions. [2018-11-18 12:18:54,437 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 69 transitions. [2018-11-18 12:18:54,437 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 12:18:54,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 69 transitions. [2018-11-18 12:18:54,438 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 12:18:54,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:18:54,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:18:54,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:18:54,439 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-18 12:18:54,439 INFO L794 eck$LassoCheckResult]: Stem: 810#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 806#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; 807#L367 assume !(main_~length~0 < 1); 802#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 803#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 791#L370-4 assume true; 792#L370-1 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 819#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 818#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 793#L370-4 assume true; 794#L370-1 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 845#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 815#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 816#L370-4 assume true; 817#L370-1 assume !(main_~i~0 < main_~length~0); 843#L370-5 main_~j~0 := 0; 827#L378-2 assume true; 823#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 824#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 820#L378-2 assume true; 797#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 798#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 801#L378-2 assume true; 795#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 796#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 834#L378-2 [2018-11-18 12:18:54,439 INFO L796 eck$LassoCheckResult]: Loop: 834#L378-2 assume true; 833#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 831#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 799#L378-2 assume true; 800#L377-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 835#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 834#L378-2 [2018-11-18 12:18:54,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:54,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1008231169, now seen corresponding path program 4 times [2018-11-18 12:18:54,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:54,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:54,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:54,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:18:54,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:54,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:54,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2017544031, now seen corresponding path program 1 times [2018-11-18 12:18:54,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:54,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:54,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:54,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:18:54,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:54,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:54,476 INFO L82 PathProgramCache]: Analyzing trace with hash 997371357, now seen corresponding path program 5 times [2018-11-18 12:18:54,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:18:54,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:18:54,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:54,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:54,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:54,912 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 122 [2018-11-18 12:18:55,144 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 64 [2018-11-18 12:18:55,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:18:55 BoogieIcfgContainer [2018-11-18 12:18:55,165 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:18:55,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:18:55,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:18:55,166 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:18:55,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:18:50" (3/4) ... [2018-11-18 12:18:55,169 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 12:18:55,209 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b5906686-27af-4106-9d4f-1b75b578da02/bin-2019/uautomizer/witness.graphml [2018-11-18 12:18:55,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:18:55,210 INFO L168 Benchmark]: Toolchain (without parser) took 5005.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.0 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 169.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:18:55,211 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:18:55,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:18:55,212 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.61 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:18:55,212 INFO L168 Benchmark]: Boogie Preprocessor took 14.65 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-18 12:18:55,212 INFO L168 Benchmark]: RCFGBuilder took 156.91 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:18:55,213 INFO L168 Benchmark]: BuchiAutomizer took 4400.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.6 MB). Peak memory consumption was 177.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:18:55,213 INFO L168 Benchmark]: Witness Printer took 43.80 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:18:55,216 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.61 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.65 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 156.91 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4400.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.6 MB). Peak memory consumption was 177.9 MB. Max. memory is 11.5 GB. * Witness Printer took 43.80 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 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 2 * j + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 55 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 3.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 55 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 81 SDtfs, 121 SDslu, 121 SDs, 0 SdLazy, 183 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital187 mio100 ax100 hnf99 lsp70 ukn106 mio100 lsp47 div141 bol100 ite100 ukn100 eq153 hnf70 smp93 dnf109 smp98 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 2 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. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {NULL=0, \result=0, arr=3, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10dcdefd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@647744d9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6031a225=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@358c4b04=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6031a225=3, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@2bb73ff3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@60fb8eb3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@4d72f4af=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@50d06fa1=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