./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/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_b03f3f3b-87e1-4f0e-b354-dc835cd86436/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/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-635dfa2 [2018-12-01 18:41:49,416 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 18:41:49,417 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 18:41:49,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 18:41:49,423 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 18:41:49,424 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 18:41:49,424 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 18:41:49,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 18:41:49,426 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 18:41:49,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 18:41:49,427 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 18:41:49,427 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 18:41:49,428 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 18:41:49,428 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 18:41:49,429 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 18:41:49,429 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 18:41:49,430 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 18:41:49,431 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 18:41:49,432 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 18:41:49,433 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 18:41:49,433 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 18:41:49,434 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 18:41:49,435 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 18:41:49,435 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 18:41:49,435 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 18:41:49,436 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 18:41:49,436 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 18:41:49,437 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 18:41:49,437 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 18:41:49,438 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 18:41:49,438 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 18:41:49,438 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 18:41:49,438 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 18:41:49,439 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 18:41:49,439 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 18:41:49,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 18:41:49,440 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 18:41:49,449 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 18:41:49,449 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 18:41:49,450 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 18:41:49,450 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 18:41:49,450 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 18:41:49,450 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 18:41:49,450 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 18:41:49,451 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 18:41:49,451 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 18:41:49,451 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 18:41:49,451 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 18:41:49,451 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 18:41:49,451 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 18:41:49,451 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 18:41:49,451 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 18:41:49,451 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 18:41:49,451 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 18:41:49,451 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 18:41:49,451 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 18:41:49,452 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 18:41:49,452 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 18:41:49,452 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 18:41:49,452 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 18:41:49,452 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 18:41:49,452 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 18:41:49,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 18:41:49,452 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 18:41:49,452 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 18:41:49,453 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 18:41:49,453 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_b03f3f3b-87e1-4f0e-b354-dc835cd86436/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-12-01 18:41:49,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 18:41:49,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 18:41:49,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 18:41:49,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 18:41:49,480 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 18:41:49,480 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i [2018-12-01 18:41:49,514 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/bin-2019/uautomizer/data/3433853ba/b9356c1bea054fc6a8e46db5e315af1a/FLAG69ebed57b [2018-12-01 18:41:49,984 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 18:41:49,984 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i [2018-12-01 18:41:49,990 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/bin-2019/uautomizer/data/3433853ba/b9356c1bea054fc6a8e46db5e315af1a/FLAG69ebed57b [2018-12-01 18:41:49,998 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/bin-2019/uautomizer/data/3433853ba/b9356c1bea054fc6a8e46db5e315af1a [2018-12-01 18:41:50,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 18:41:50,001 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 18:41:50,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 18:41:50,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 18:41:50,003 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 18:41:50,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:41:49" (1/1) ... [2018-12-01 18:41:50,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@501fac56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:41:50, skipping insertion in model container [2018-12-01 18:41:50,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:41:49" (1/1) ... [2018-12-01 18:41:50,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 18:41:50,025 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 18:41:50,173 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:41:50,179 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 18:41:50,257 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:41:50,288 INFO L195 MainTranslator]: Completed translation [2018-12-01 18:41:50,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:41:50 WrapperNode [2018-12-01 18:41:50,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 18:41:50,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 18:41:50,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 18:41:50,289 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 18:41:50,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:41:50" (1/1) ... [2018-12-01 18:41:50,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:41:50" (1/1) ... [2018-12-01 18:41:50,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 18:41:50,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 18:41:50,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 18:41:50,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 18:41:50,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:41:50" (1/1) ... [2018-12-01 18:41:50,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:41:50" (1/1) ... [2018-12-01 18:41:50,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:41:50" (1/1) ... [2018-12-01 18:41:50,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:41:50" (1/1) ... [2018-12-01 18:41:50,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:41:50" (1/1) ... [2018-12-01 18:41:50,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:41:50" (1/1) ... [2018-12-01 18:41:50,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:41:50" (1/1) ... [2018-12-01 18:41:50,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 18:41:50,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 18:41:50,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 18:41:50,326 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 18:41:50,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:41:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/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-12-01 18:41:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 18:41:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 18:41:50,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 18:41:50,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 18:41:50,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 18:41:50,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 18:41:50,462 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 18:41:50,462 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-01 18:41:50,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:41:50 BoogieIcfgContainer [2018-12-01 18:41:50,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 18:41:50,463 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 18:41:50,463 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 18:41:50,465 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 18:41:50,466 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:41:50,466 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 06:41:49" (1/3) ... [2018-12-01 18:41:50,466 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1da03845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 06:41:50, skipping insertion in model container [2018-12-01 18:41:50,466 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:41:50,467 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:41:50" (2/3) ... [2018-12-01 18:41:50,467 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1da03845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 06:41:50, skipping insertion in model container [2018-12-01 18:41:50,467 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:41:50,467 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:41:50" (3/3) ... [2018-12-01 18:41:50,468 INFO L375 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original_false-termination.c.i [2018-12-01 18:41:50,498 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 18:41:50,498 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 18:41:50,498 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 18:41:50,498 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 18:41:50,499 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 18:41:50,499 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 18:41:50,499 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 18:41:50,499 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 18:41:50,499 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 18:41:50,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-01 18:41:50,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-01 18:41:50,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:41:50,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:41:50,525 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 18:41:50,525 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 18:41:50,525 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 18:41:50,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-01 18:41:50,526 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-01 18:41:50,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:41:50,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:41:50,526 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 18:41:50,526 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 18:41:50,531 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true 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; 16#L367true assume !(main_~length~0 < 1); 5#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; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2018-12-01 18:41:50,531 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true 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); 9#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); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2018-12-01 18:41:50,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:50,535 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-12-01 18:41:50,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:50,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:50,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:50,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:41:50,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:50,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:50,602 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2018-12-01 18:41:50,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:50,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:50,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:50,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:41:50,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:50,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2018-12-01 18:41:50,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:50,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:50,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:50,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:41:50,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:50,803 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:41:50,804 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:41:50,804 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:41:50,804 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:41:50,804 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 18:41:50,804 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:41:50,804 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:41:50,804 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:41:50,804 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration1_Lasso [2018-12-01 18:41:50,804 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:41:50,805 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:41:50,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:50,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:50,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:50,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:50,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:50,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:50,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:50,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:50,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:50,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:50,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:50,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:51,043 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:41:51,047 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 18:41:51,048 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-12-01 18:41:51,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:51,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:41:51,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:51,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:51,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:51,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:41:51,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:41:51,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:51,053 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-12-01 18:41:51,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:51,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:41:51,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:51,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:51,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:51,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:41:51,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:41:51,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:51,056 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-12-01 18:41:51,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:51,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:41:51,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:51,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:51,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:51,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:41:51,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:41:51,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:51,058 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-12-01 18:41:51,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:51,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:41:51,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:51,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:51,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:51,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:41:51,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:41:51,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:51,060 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-12-01 18:41:51,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:51,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:51,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:51,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:51,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:41:51,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:41:51,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:51,065 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-12-01 18:41:51,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:51,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:41:51,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:51,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:51,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:51,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:41:51,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:41:51,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:51,068 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-12-01 18:41:51,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:51,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:41:51,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:51,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:51,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:51,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:41:51,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:41:51,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:51,070 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-12-01 18:41:51,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:51,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:41:51,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:51,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:51,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:51,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:41:51,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:41:51,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:51,072 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-12-01 18:41:51,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:51,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:51,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:51,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:51,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:41:51,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:41:51,102 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 18:41:51,130 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-01 18:41:51,130 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-01 18:41:51,132 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 18:41:51,133 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 18:41:51,133 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 18:41:51,133 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2018-12-01 18:41:51,150 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-01 18:41:51,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 18:41:51,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:41:51,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:41:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:41:51,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:41:51,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:41:51,206 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-12-01 18:41:51,206 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2018-12-01 18:41:51,237 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2018-12-01 18:41:51,238 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-12-01 18:41:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 18:41:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-12-01 18:41:51,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-01 18:41:51,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:41:51,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-01 18:41:51,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:41:51,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2018-12-01 18:41:51,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:41:51,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2018-12-01 18:41:51,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 18:41:51,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2018-12-01 18:41:51,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-01 18:41:51,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-01 18:41:51,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2018-12-01 18:41:51,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:41:51,247 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-12-01 18:41:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2018-12-01 18:41:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-01 18:41:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-01 18:41:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-12-01 18:41:51,263 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-12-01 18:41:51,264 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-12-01 18:41:51,264 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 18:41:51,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2018-12-01 18:41:51,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 18:41:51,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:41:51,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:41:51,264 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:41:51,265 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 18:41:51,265 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#L-1 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; 114#L367 assume !(main_~length~0 < 1); 121#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; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2018-12-01 18:41:51,265 INFO L796 eck$LassoCheckResult]: Loop: 118#L378-2 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); 120#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; 118#L378-2 [2018-12-01 18:41:51,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:51,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2018-12-01 18:41:51,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:51,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:51,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:51,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:41:51,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:41:51,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:41:51,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:41:51,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 18:41:51,292 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 18:41:51,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:51,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2018-12-01 18:41:51,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:51,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:51,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:51,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:41:51,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:51,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 18:41:51,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:41:51,356 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-12-01 18:41:51,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:41:51,374 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-12-01 18:41:51,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 18:41:51,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-12-01 18:41:51,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 18:41:51,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2018-12-01 18:41:51,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-01 18:41:51,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-01 18:41:51,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-12-01 18:41:51,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:41:51,376 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-01 18:41:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-12-01 18:41:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-12-01 18:41:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-01 18:41:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-12-01 18:41:51,377 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-01 18:41:51,377 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-01 18:41:51,377 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 18:41:51,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-12-01 18:41:51,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 18:41:51,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:41:51,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:41:51,378 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:41:51,378 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 18:41:51,378 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 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; 147#L367 assume !(main_~length~0 < 1); 154#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; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 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); 148#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; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2018-12-01 18:41:51,378 INFO L796 eck$LassoCheckResult]: Loop: 151#L378-2 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); 153#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; 151#L378-2 [2018-12-01 18:41:51,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:51,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2018-12-01 18:41:51,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:51,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:51,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:51,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:41:51,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:51,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:51,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2018-12-01 18:41:51,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:51,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:51,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:51,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:41:51,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:51,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2018-12-01 18:41:51,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:51,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:51,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:51,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:41:51,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:51,702 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-12-01 18:41:51,703 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:41:51,703 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:41:51,703 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:41:51,703 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:41:51,703 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 18:41:51,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:41:51,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:41:51,704 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:41:51,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration3_Lasso [2018-12-01 18:41:51,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:41:51,704 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:41:51,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:51,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:51,847 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-01 18:41:51,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:51,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:51,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:51,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:51,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:51,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:51,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:51,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:51,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:51,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:52,077 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:41:52,077 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 18:41:52,077 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-12-01 18:41:52,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:52,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:41:52,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:52,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:52,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:52,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:41:52,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:41:52,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:52,078 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-12-01 18:41:52,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:52,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:52,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:52,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:52,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:41:52,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:41:52,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:52,081 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-12-01 18:41:52,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:52,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:52,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:52,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:52,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:41:52,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:41:52,094 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 18:41:52,099 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-01 18:41:52,099 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-01 18:41:52,099 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 18:41:52,100 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 18:41:52,100 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 18:41:52,100 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-12-01 18:41:52,111 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-01 18:41:52,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:41:52,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:41:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:41:52,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:41:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:41:52,136 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-12-01 18:41:52,136 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-01 18:41:52,146 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2018-12-01 18:41:52,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 18:41:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 18:41:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-01 18:41:52,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-01 18:41:52,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:41:52,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-01 18:41:52,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:41:52,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-01 18:41:52,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:41:52,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2018-12-01 18:41:52,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 18:41:52,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2018-12-01 18:41:52,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 18:41:52,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 18:41:52,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-12-01 18:41:52,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 18:41:52,150 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-01 18:41:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-12-01 18:41:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-01 18:41:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-01 18:41:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-12-01 18:41:52,151 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-01 18:41:52,151 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-01 18:41:52,151 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 18:41:52,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-12-01 18:41:52,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 18:41:52,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:41:52,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:41:52,153 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:41:52,153 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 18:41:52,153 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 245#L-1 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; 246#L367 assume !(main_~length~0 < 1); 255#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; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#L370-3 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); 243#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; 244#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 258#L370-3 assume !(main_~i~0 < main_~length~0); 247#L370-4 main_~j~0 := 0; 248#L378-2 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); 254#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; 250#L378-2 [2018-12-01 18:41:52,153 INFO L796 eck$LassoCheckResult]: Loop: 250#L378-2 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); 251#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; 250#L378-2 [2018-12-01 18:41:52,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:52,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2018-12-01 18:41:52,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:52,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:52,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:41:52,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:52,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:52,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2018-12-01 18:41:52,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:52,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:52,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:41:52,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:52,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2018-12-01 18:41:52,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:52,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:41:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:41:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 18:41:52,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 18:41:52,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/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-12-01 18:41:52,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:41:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:41:52,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:41:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 18:41:52,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 18:41:52,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-12-01 18:41:52,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 18:41:52,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 18:41:52,306 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-01 18:41:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:41:52,316 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-12-01 18:41:52,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 18:41:52,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-12-01 18:41:52,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 18:41:52,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2018-12-01 18:41:52,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-01 18:41:52,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 18:41:52,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-12-01 18:41:52,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 18:41:52,318 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-01 18:41:52,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-12-01 18:41:52,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-01 18:41:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-01 18:41:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-12-01 18:41:52,319 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-12-01 18:41:52,319 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-12-01 18:41:52,319 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 18:41:52,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2018-12-01 18:41:52,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 18:41:52,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:41:52,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:41:52,319 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:41:52,319 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 18:41:52,319 INFO L794 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 327#L-1 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; 328#L367 assume !(main_~length~0 < 1); 337#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; 338#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 339#L370-3 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); 329#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; 330#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 340#L370-3 assume !(main_~i~0 < main_~length~0); 331#L370-4 main_~j~0 := 0; 332#L378-2 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); 334#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; 335#L378-2 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); 336#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; 341#L378-2 [2018-12-01 18:41:52,320 INFO L796 eck$LassoCheckResult]: Loop: 341#L378-2 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); 342#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; 341#L378-2 [2018-12-01 18:41:52,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:52,320 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2018-12-01 18:41:52,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:52,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:52,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:41:52,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:41:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:41:52,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 18:41:52,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/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-12-01 18:41:52,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 18:41:52,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 18:41:52,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 18:41:52,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:41:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:41:52,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 18:41:52,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-01 18:41:52,405 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 18:41:52,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2018-12-01 18:41:52,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:52,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:41:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:52,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 18:41:52,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-01 18:41:52,449 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 10 states. [2018-12-01 18:41:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:41:52,504 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2018-12-01 18:41:52,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 18:41:52,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2018-12-01 18:41:52,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 18:41:52,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 27 transitions. [2018-12-01 18:41:52,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-01 18:41:52,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 18:41:52,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-12-01 18:41:52,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 18:41:52,505 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-01 18:41:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-12-01 18:41:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-12-01 18:41:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-01 18:41:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-01 18:41:52,506 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-01 18:41:52,506 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-01 18:41:52,506 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 18:41:52,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-12-01 18:41:52,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 18:41:52,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:41:52,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:41:52,507 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:41:52,507 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 18:41:52,507 INFO L794 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 440#L-1 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; 441#L367 assume !(main_~length~0 < 1); 450#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; 451#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 452#L370-3 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); 455#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; 453#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 454#L370-3 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); 438#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; 439#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 456#L370-3 assume !(main_~i~0 < main_~length~0); 442#L370-4 main_~j~0 := 0; 443#L378-2 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); 449#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; 447#L378-2 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); 448#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; 445#L378-2 [2018-12-01 18:41:52,507 INFO L796 eck$LassoCheckResult]: Loop: 445#L378-2 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); 446#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; 445#L378-2 [2018-12-01 18:41:52,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:52,507 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2018-12-01 18:41:52,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:52,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:52,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:41:52,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:52,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:52,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2018-12-01 18:41:52,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:52,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:52,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:41:52,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:52,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:52,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2018-12-01 18:41:52,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:52,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:41:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:52,834 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 118 [2018-12-01 18:41:53,041 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2018-12-01 18:41:53,042 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:41:53,042 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:41:53,042 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:41:53,042 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:41:53,042 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 18:41:53,042 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:41:53,042 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:41:53,042 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:41:53,042 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration6_Lasso [2018-12-01 18:41:53,042 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:41:53,042 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:41:53,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:53,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:53,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:53,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:53,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:53,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:53,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:53,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:53,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:53,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:53,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:53,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:41:53,332 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:41:53,332 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 18:41:53,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:41:53,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:53,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:41:53,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:53,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:53,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:53,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:41:53,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:41:53,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:53,334 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-12-01 18:41:53,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:53,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:41:53,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:53,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:53,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:53,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:41:53,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:41:53,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:53,336 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-12-01 18:41:53,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:53,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:53,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:53,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:53,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:41:53,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:41:53,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:53,338 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-12-01 18:41:53,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:53,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:41:53,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:53,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:53,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:53,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:41:53,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:41:53,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:53,339 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-12-01 18:41:53,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:53,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:41:53,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:53,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:53,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:53,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:41:53,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:41:53,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:53,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:41:53,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:53,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:41:53,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:53,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:53,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:53,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:41:53,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:41:53,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:53,343 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-12-01 18:41:53,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:53,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:53,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:53,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:53,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:41:53,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:41:53,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:53,346 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-12-01 18:41:53,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:53,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:53,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:53,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:53,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:41:53,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:41:53,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:41:53,354 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-12-01 18:41:53,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:41:53,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:41:53,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:41:53,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:41:53,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:41:53,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:41:53,366 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 18:41:53,372 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 18:41:53,372 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-01 18:41:53,373 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 18:41:53,374 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 18:41:53,374 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 18:41:53,374 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-12-01 18:41:53,385 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-12-01 18:41:53,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:41:53,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:41:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:41:53,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:41:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:41:53,424 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-12-01 18:41:53,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-01 18:41:53,432 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 5 states. [2018-12-01 18:41:53,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 18:41:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 18:41:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-01 18:41:53,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2018-12-01 18:41:53,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:41:53,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 19 letters. Loop has 2 letters. [2018-12-01 18:41:53,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:41:53,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 4 letters. [2018-12-01 18:41:53,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:41:53,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-12-01 18:41:53,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 18:41:53,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2018-12-01 18:41:53,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-01 18:41:53,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-01 18:41:53,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2018-12-01 18:41:53,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 18:41:53,436 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-01 18:41:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2018-12-01 18:41:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-01 18:41:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-01 18:41:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-12-01 18:41:53,438 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-01 18:41:53,438 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-01 18:41:53,438 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 18:41:53,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-12-01 18:41:53,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 18:41:53,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:41:53,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:41:53,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:41:53,439 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 18:41:53,439 INFO L794 eck$LassoCheckResult]: Stem: 588#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 582#L-1 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; 583#L367 assume !(main_~length~0 < 1); 594#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; 595#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 596#L370-3 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); 600#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; 597#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 598#L370-3 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); 584#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; 585#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 601#L370-3 assume !(main_~i~0 < main_~length~0); 586#L370-4 main_~j~0 := 0; 587#L378-2 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); 593#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; 591#L378-2 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); 592#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 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); 602#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; 589#L378-2 [2018-12-01 18:41:53,439 INFO L796 eck$LassoCheckResult]: Loop: 589#L378-2 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); 590#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; 589#L378-2 [2018-12-01 18:41:53,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:53,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2018-12-01 18:41:53,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:53,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:53,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:53,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:41:53,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:41:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 18:41:53,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 18:41:53,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 18:41:53,577 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-01 18:41:53,588 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-12-01 18:41:53,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 18:41:53,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:41:53,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-01 18:41:53,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-01 18:41:53,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 18:41:53,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 18:41:53,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 18:41:53,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-01 18:41:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 18:41:53,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 18:41:53,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-01 18:41:53,671 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 18:41:53,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:53,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2018-12-01 18:41:53,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:53,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:53,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:53,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:41:53,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:53,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 18:41:53,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-01 18:41:53,727 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-12-01 18:41:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:41:53,780 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-12-01 18:41:53,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 18:41:53,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2018-12-01 18:41:53,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-01 18:41:53,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 46 transitions. [2018-12-01 18:41:53,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-01 18:41:53,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-01 18:41:53,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2018-12-01 18:41:53,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 18:41:53,783 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-12-01 18:41:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2018-12-01 18:41:53,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-01 18:41:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-01 18:41:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2018-12-01 18:41:53,785 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-12-01 18:41:53,785 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-12-01 18:41:53,785 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 18:41:53,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2018-12-01 18:41:53,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-01 18:41:53,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:41:53,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:41:53,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:41:53,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-12-01 18:41:53,786 INFO L794 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 712#L-1 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; 713#L367 assume !(main_~length~0 < 1); 723#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; 724#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 725#L370-3 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); 714#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; 715#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 731#L370-3 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); 732#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; 726#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 727#L370-3 assume !(main_~i~0 < main_~length~0); 716#L370-4 main_~j~0 := 0; 717#L378-2 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); 719#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; 720#L378-2 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); 721#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; 728#L378-2 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); 744#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; 742#L378-2 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); 739#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; 737#L378-2 [2018-12-01 18:41:53,786 INFO L796 eck$LassoCheckResult]: Loop: 737#L378-2 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); 733#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; 734#L378-2 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); 738#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; 737#L378-2 [2018-12-01 18:41:53,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:53,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1142942490, now seen corresponding path program 6 times [2018-12-01 18:41:53,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:53,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:53,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:53,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:41:53,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:53,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:53,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2018-12-01 18:41:53,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:53,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:53,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:53,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:41:53,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:53,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:41:53,818 INFO L82 PathProgramCache]: Analyzing trace with hash -227346514, now seen corresponding path program 7 times [2018-12-01 18:41:53,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:41:53,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:41:53,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:53,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:41:53,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:41:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:41:54,227 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 132 [2018-12-01 18:41:54,386 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2018-12-01 18:41:54,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 06:41:54 BoogieIcfgContainer [2018-12-01 18:41:54,406 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 18:41:54,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 18:41:54,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 18:41:54,407 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 18:41:54,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:41:50" (3/4) ... [2018-12-01 18:41:54,410 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-01 18:41:54,443 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b03f3f3b-87e1-4f0e-b354-dc835cd86436/bin-2019/uautomizer/witness.graphml [2018-12-01 18:41:54,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 18:41:54,444 INFO L168 Benchmark]: Toolchain (without parser) took 4443.38 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 281.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -133.8 MB). Peak memory consumption was 147.8 MB. Max. memory is 11.5 GB. [2018-12-01 18:41:54,444 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:41:54,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -139.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-01 18:41:54,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:41:54,446 INFO L168 Benchmark]: Boogie Preprocessor took 13.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:41:54,446 INFO L168 Benchmark]: RCFGBuilder took 136.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-12-01 18:41:54,446 INFO L168 Benchmark]: BuchiAutomizer took 3943.34 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.5 MB). Peak memory consumption was 138.5 MB. Max. memory is 11.5 GB. [2018-12-01 18:41:54,447 INFO L168 Benchmark]: Witness Printer took 36.37 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2018-12-01 18:41:54,449 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -139.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 136.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3943.34 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.5 MB). Peak memory consumption was 138.5 MB. Max. memory is 11.5 GB. * Witness Printer took 36.37 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 8 iterations. TraceHistogramMax:4. Analysis of lassos took 3.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 99 SDslu, 79 SDs, 0 SdLazy, 172 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital164 mio100 ax100 hnf99 lsp80 ukn93 mio100 lsp53 div160 bol100 ite100 ukn100 eq155 hnf64 smp92 dnf109 smp98 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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=5, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f114595=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@330b6fbf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64cb5e91=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@22a70d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64cb5e91=5, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@42b99417=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@2b723ac4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@37ad5ea9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1522c4e5=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] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i