./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array16_alloca_original.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/array16_alloca_original.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.25-906a4fb [2020-10-19 18:49:20,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:49:20,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:49:20,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:49:20,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:49:20,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:49:20,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:49:20,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:49:20,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:49:20,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:49:20,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:49:20,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:49:20,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:49:20,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:49:20,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:49:20,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:49:20,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:49:20,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:49:20,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:49:20,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:49:20,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:49:20,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:49:20,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:49:20,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:49:20,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:49:20,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:49:20,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:49:20,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:49:20,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:49:20,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:49:20,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:49:20,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:49:20,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:49:20,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:49:20,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:49:20,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:49:20,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:49:20,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:49:20,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:49:20,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:49:20,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:49:20,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-19 18:49:20,553 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:49:20,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:49:20,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:49:20,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:49:20,556 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:49:20,556 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:49:20,556 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:49:20,556 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:49:20,557 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:49:20,557 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:49:20,558 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:49:20,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:49:20,559 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:49:20,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:49:20,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:49:20,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:49:20,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:49:20,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:49:20,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:49:20,560 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:49:20,560 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:49:20,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:49:20,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:49:20,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:49:20,562 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:49:20,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:49:20,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:49:20,562 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:49:20,563 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:49:20,564 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:49:20,564 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2020-10-19 18:49:20,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:49:20,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:49:20,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:49:20,909 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:49:20,910 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:49:20,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array16_alloca_original.i [2020-10-19 18:49:20,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4eff9529/c8e8ebdb53ee409189279fa46a88816f/FLAG222ae5f1a [2020-10-19 18:49:21,492 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:49:21,493 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array16_alloca_original.i [2020-10-19 18:49:21,502 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4eff9529/c8e8ebdb53ee409189279fa46a88816f/FLAG222ae5f1a [2020-10-19 18:49:21,803 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4eff9529/c8e8ebdb53ee409189279fa46a88816f [2020-10-19 18:49:21,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:49:21,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:49:21,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:49:21,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:49:21,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:49:21,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:49:21" (1/1) ... [2020-10-19 18:49:21,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47569d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:21, skipping insertion in model container [2020-10-19 18:49:21,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:49:21" (1/1) ... [2020-10-19 18:49:21,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:49:21,888 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:49:22,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:49:22,311 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:49:22,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:49:22,435 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:49:22,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:22 WrapperNode [2020-10-19 18:49:22,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:49:22,437 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:49:22,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:49:22,437 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:49:22,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:22" (1/1) ... [2020-10-19 18:49:22,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:22" (1/1) ... [2020-10-19 18:49:22,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:49:22,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:49:22,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:49:22,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:49:22,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:22" (1/1) ... [2020-10-19 18:49:22,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:22" (1/1) ... [2020-10-19 18:49:22,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:22" (1/1) ... [2020-10-19 18:49:22,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:22" (1/1) ... [2020-10-19 18:49:22,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:22" (1/1) ... [2020-10-19 18:49:22,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:22" (1/1) ... [2020-10-19 18:49:22,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:22" (1/1) ... [2020-10-19 18:49:22,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:49:22,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:49:22,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:49:22,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:49:22,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-19 18:49:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 18:49:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 18:49:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 18:49:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 18:49:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:49:22,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:49:22,837 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:49:22,838 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-19 18:49:22,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:49:22 BoogieIcfgContainer [2020-10-19 18:49:22,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:49:22,841 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:49:22,842 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:49:22,847 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:49:22,848 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:49:22,848 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:49:21" (1/3) ... [2020-10-19 18:49:22,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@477d3803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:49:22, skipping insertion in model container [2020-10-19 18:49:22,849 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:49:22,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:49:22" (2/3) ... [2020-10-19 18:49:22,850 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@477d3803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:49:22, skipping insertion in model container [2020-10-19 18:49:22,850 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:49:22,850 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:49:22" (3/3) ... [2020-10-19 18:49:22,852 INFO L373 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original.i [2020-10-19 18:49:22,934 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:49:22,934 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:49:22,934 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:49:22,935 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:49:22,935 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:49:22,935 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:49:22,935 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:49:22,935 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:49:22,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-10-19 18:49:22,971 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 18:49:22,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:22,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:22,977 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:49:22,978 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:49:22,978 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:49:22,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-10-19 18:49:22,979 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 18:49:22,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:22,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:22,980 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:49:22,980 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:49:22,986 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2020-10-19 18:49:22,987 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 [2020-10-19 18:49:22,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:22,993 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-10-19 18:49:23,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:23,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496399324] [2020-10-19 18:49:23,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:23,105 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:23,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:23,138 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:23,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:23,140 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2020-10-19 18:49:23,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:23,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740764822] [2020-10-19 18:49:23,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:23,162 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:23,175 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:23,179 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:23,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:23,181 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2020-10-19 18:49:23,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:23,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478602764] [2020-10-19 18:49:23,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:23,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:23,228 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:23,240 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:23,528 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:49:23,529 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:49:23,529 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:49:23,529 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:49:23,529 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:49:23,530 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:23,530 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:49:23,530 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:49:23,530 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration1_Lasso [2020-10-19 18:49:23,530 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:49:23,531 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:49:23,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:23,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:23,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:23,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:23,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:23,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:23,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:23,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:23,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:23,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:23,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:23,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:24,006 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:49:24,012 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:24,018 INFO L120 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 [2020-10-19 18:49:24,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:24,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:24,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:24,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:24,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:24,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:24,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:24,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:24,055 INFO L120 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 [2020-10-19 18:49:24,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:24,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:24,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:24,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:24,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:24,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:24,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:49:24,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:24,098 INFO L120 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 [2020-10-19 18:49:24,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:24,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:24,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:24,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:24,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:24,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:24,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:49:24,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:24,152 INFO L120 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 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:24,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:24,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:24,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:24,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:24,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:24,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:24,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:49:24,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:24,211 INFO L120 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 [2020-10-19 18:49:24,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:24,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:24,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:24,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:24,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:24,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:24,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:24,285 INFO L120 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 [2020-10-19 18:49:24,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:24,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:24,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:24,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:24,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:24,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:24,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:24,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:24,359 INFO L120 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 [2020-10-19 18:49:24,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:24,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:24,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:24,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:24,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:24,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:24,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:49:24,434 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-19 18:49:24,434 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:24,444 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:24,449 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:49:24,449 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:49:24,450 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-10-19 18:49:24,500 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-10-19 18:49:24,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:24,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:49:24,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:24,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:49:24,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:49:24,634 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 [2020-10-19 18:49:24,636 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2020-10-19 18:49:24,710 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2020-10-19 18:49:24,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:49:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:49:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-10-19 18:49:24,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-19 18:49:24,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:24,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2020-10-19 18:49:24,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:24,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2020-10-19 18:49:24,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:24,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2020-10-19 18:49:24,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:24,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2020-10-19 18:49:24,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-19 18:49:24,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-19 18:49:24,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2020-10-19 18:49:24,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:49:24,738 INFO L691 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-10-19 18:49:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2020-10-19 18:49:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-10-19 18:49:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-19 18:49:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2020-10-19 18:49:24,769 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-10-19 18:49:24,770 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-10-19 18:49:24,770 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:49:24,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2020-10-19 18:49:24,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:24,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:24,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:24,773 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:49:24,774 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:49:24,774 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2020-10-19 18:49:24,774 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 [2020-10-19 18:49:24,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:24,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2020-10-19 18:49:24,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:24,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831841034] [2020-10-19 18:49:24,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:49:24,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831841034] [2020-10-19 18:49:24,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:49:24,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 18:49:24,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736023433] [2020-10-19 18:49:24,873 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:49:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:24,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2020-10-19 18:49:24,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:24,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749142112] [2020-10-19 18:49:24,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:24,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:24,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:24,916 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:24,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:49:24,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 18:49:24,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-19 18:49:24,994 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-10-19 18:49:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:49:25,033 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-10-19 18:49:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 18:49:25,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2020-10-19 18:49:25,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:25,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2020-10-19 18:49:25,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-19 18:49:25,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-19 18:49:25,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-10-19 18:49:25,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:49:25,037 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-19 18:49:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-10-19 18:49:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2020-10-19 18:49:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-19 18:49:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-10-19 18:49:25,040 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-10-19 18:49:25,040 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-10-19 18:49:25,040 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:49:25,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-10-19 18:49:25,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:25,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:25,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:25,042 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:49:25,043 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:49:25,043 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2020-10-19 18:49:25,043 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 [2020-10-19 18:49:25,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:25,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2020-10-19 18:49:25,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:25,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873475210] [2020-10-19 18:49:25,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:25,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:25,074 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:25,078 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:25,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:25,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2020-10-19 18:49:25,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:25,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902694186] [2020-10-19 18:49:25,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:25,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:25,097 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:25,100 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:25,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:25,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2020-10-19 18:49:25,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:25,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491519263] [2020-10-19 18:49:25,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:25,155 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:25,202 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:25,213 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:25,440 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2020-10-19 18:49:26,276 WARN L193 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2020-10-19 18:49:26,281 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:49:26,281 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:49:26,281 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:49:26,281 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:49:26,281 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:49:26,282 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:26,282 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:49:26,282 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:49:26,282 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration3_Lasso [2020-10-19 18:49:26,282 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:49:26,282 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:49:26,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:26,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:26,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:26,337 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2020-10-19 18:49:26,860 WARN L193 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2020-10-19 18:49:26,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:26,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:26,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:26,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:26,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:26,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:26,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:26,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:27,178 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2020-10-19 18:49:27,476 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-10-19 18:49:27,523 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:49:27,523 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:27,536 INFO L120 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 [2020-10-19 18:49:27,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:27,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:27,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:27,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:27,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:27,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:27,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:27,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:27,578 INFO L120 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 [2020-10-19 18:49:27,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:27,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:49:27,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:27,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:27,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:27,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:49:27,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:49:27,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:27,618 INFO L120 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 [2020-10-19 18:49:27,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:27,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:27,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:27,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:27,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:27,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:49:27,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:27,684 INFO L120 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 [2020-10-19 18:49:27,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:27,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:27,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:27,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:27,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:27,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:49:27,705 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:27,752 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2020-10-19 18:49:27,752 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:27,765 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:27,769 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:49:27,769 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:49:27,769 INFO L512 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 [] [2020-10-19 18:49:27,844 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-10-19 18:49:27,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:27,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:49:27,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:27,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:49:27,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:49:27,935 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 [2020-10-19 18:49:27,936 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-10-19 18:49:27,954 INFO L75 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. [2020-10-19 18:49:27,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 18:49:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:49:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2020-10-19 18:49:27,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2020-10-19 18:49:27,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:27,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2020-10-19 18:49:27,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:27,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2020-10-19 18:49:27,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:27,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2020-10-19 18:49:27,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:27,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2020-10-19 18:49:27,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 18:49:27,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 18:49:27,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-10-19 18:49:27,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:49:27,961 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-19 18:49:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-10-19 18:49:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-10-19 18:49:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-19 18:49:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-10-19 18:49:27,964 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-19 18:49:27,964 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-19 18:49:27,964 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:49:27,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-10-19 18:49:27,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:27,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:27,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:27,966 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:49:27,967 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:49:27,967 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2020-10-19 18:49:27,967 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 [2020-10-19 18:49:27,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:27,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2020-10-19 18:49:27,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:27,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542366972] [2020-10-19 18:49:27,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:27,989 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:28,000 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:28,004 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:28,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2020-10-19 18:49:28,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:28,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44157041] [2020-10-19 18:49:28,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:28,011 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:28,015 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:28,017 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:28,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:28,018 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2020-10-19 18:49:28,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:28,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714924840] [2020-10-19 18:49:28,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 18:49:28,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714924840] [2020-10-19 18:49:28,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619802512] [2020-10-19 18:49:28,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:49:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:28,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-19 18:49:28,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 18:49:28,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 18:49:28,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-10-19 18:49:28,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773113560] [2020-10-19 18:49:28,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:49:28,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 18:49:28,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-19 18:49:28,174 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-19 18:49:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:49:28,192 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-10-19 18:49:28,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 18:49:28,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2020-10-19 18:49:28,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:28,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2020-10-19 18:49:28,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-19 18:49:28,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 18:49:28,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2020-10-19 18:49:28,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:49:28,196 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-10-19 18:49:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2020-10-19 18:49:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-10-19 18:49:28,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-19 18:49:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-10-19 18:49:28,198 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-19 18:49:28,198 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-19 18:49:28,199 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:49:28,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-10-19 18:49:28,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:28,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:28,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:28,200 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:49:28,201 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:49:28,201 INFO L794 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2020-10-19 18:49:28,201 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 [2020-10-19 18:49:28,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:28,202 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2020-10-19 18:49:28,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:28,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825549155] [2020-10-19 18:49:28,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:49:28,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825549155] [2020-10-19 18:49:28,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103628332] [2020-10-19 18:49:28,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:49:28,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 18:49:28,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:49:28,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:49:28,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:49:28,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:49:28,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-10-19 18:49:28,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276871238] [2020-10-19 18:49:28,360 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:49:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2020-10-19 18:49:28,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:28,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035653497] [2020-10-19 18:49:28,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:28,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:28,369 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:28,371 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:28,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:49:28,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 18:49:28,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-19 18:49:28,439 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 10 states. [2020-10-19 18:49:28,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:49:28,575 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-10-19 18:49:28,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 18:49:28,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2020-10-19 18:49:28,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:28,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 27 transitions. [2020-10-19 18:49:28,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-19 18:49:28,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 18:49:28,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2020-10-19 18:49:28,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:49:28,579 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-10-19 18:49:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2020-10-19 18:49:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-10-19 18:49:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-19 18:49:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-10-19 18:49:28,582 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-19 18:49:28,582 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-19 18:49:28,583 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:49:28,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-10-19 18:49:28,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:28,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:28,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:28,584 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:49:28,585 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:49:28,585 INFO L794 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2020-10-19 18:49:28,585 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 [2020-10-19 18:49:28,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:28,586 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2020-10-19 18:49:28,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:28,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582352996] [2020-10-19 18:49:28,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:28,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:28,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:28,671 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:28,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:28,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2020-10-19 18:49:28,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:28,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915979901] [2020-10-19 18:49:28,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:28,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:28,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:28,691 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:28,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:28,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2020-10-19 18:49:28,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:28,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796896498] [2020-10-19 18:49:28,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:28,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:28,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:28,773 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:29,236 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 121 [2020-10-19 18:49:30,223 WARN L193 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 76 [2020-10-19 18:49:30,226 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:49:30,226 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:49:30,226 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:49:30,226 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:49:30,226 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:49:30,227 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:30,227 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:49:30,227 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:49:30,227 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration6_Lasso [2020-10-19 18:49:30,227 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:49:30,227 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:49:30,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:30,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:30,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:30,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:30,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:30,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:30,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:30,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:30,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:30,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:30,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:30,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:49:30,807 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:49:30,807 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:30,817 INFO L120 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 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:30,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:30,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:30,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:30,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:30,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:30,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:49:30,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:30,867 INFO L120 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 [2020-10-19 18:49:30,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:30,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:30,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:30,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:30,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:30,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:49:30,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:30,903 INFO L120 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 [2020-10-19 18:49:30,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:30,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:30,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:30,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:49:30,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:30,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:49:30,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:49:30,960 INFO L120 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 [2020-10-19 18:49:30,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:49:30,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:49:30,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:49:30,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:30,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:49:30,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:49:30,982 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:49:31,021 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-10-19 18:49:31,021 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:49:31,024 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:49:31,028 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:49:31,028 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:49:31,028 INFO L512 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 [] [2020-10-19 18:49:31,066 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-19 18:49:31,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:31,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:49:31,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:31,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:49:31,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:49:31,126 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 [2020-10-19 18:49:31,126 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-10-19 18:49:31,145 INFO L75 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. [2020-10-19 18:49:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 18:49:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:49:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-10-19 18:49:31,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2020-10-19 18:49:31,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:31,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 19 letters. Loop has 2 letters. [2020-10-19 18:49:31,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:31,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 4 letters. [2020-10-19 18:49:31,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:49:31,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2020-10-19 18:49:31,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:31,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2020-10-19 18:49:31,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-19 18:49:31,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 18:49:31,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2020-10-19 18:49:31,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:49:31,151 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-10-19 18:49:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2020-10-19 18:49:31,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-10-19 18:49:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-19 18:49:31,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2020-10-19 18:49:31,153 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-10-19 18:49:31,154 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-10-19 18:49:31,154 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 18:49:31,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-10-19 18:49:31,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 18:49:31,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:31,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:31,156 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:49:31,157 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:49:31,157 INFO L794 eck$LassoCheckResult]: Stem: 580#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 574#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; 575#L367 assume !(main_~length~0 < 1); 586#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 587#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 588#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); 592#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; 589#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 590#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); 576#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; 577#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 593#L370-3 assume !(main_~i~0 < main_~length~0); 578#L370-4 main_~j~0 := 0; 579#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); 585#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; 583#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); 584#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; 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); 594#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; 581#L378-2 [2020-10-19 18:49:31,157 INFO L796 eck$LassoCheckResult]: Loop: 581#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); 582#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; 581#L378-2 [2020-10-19 18:49:31,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:31,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2020-10-19 18:49:31,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:31,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075724408] [2020-10-19 18:49:31,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:49:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-19 18:49:31,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075724408] [2020-10-19 18:49:31,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143653410] [2020-10-19 18:49:31,353 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:49:31,394 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-10-19 18:49:31,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:49:31,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-19 18:49:31,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:49:31,514 INFO L384 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 25 treesize of output 9 [2020-10-19 18:49:31,515 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:49:31,521 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:49:31,523 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:49:31,524 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:5 [2020-10-19 18:49:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-19 18:49:31,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:49:31,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-10-19 18:49:31,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181962834] [2020-10-19 18:49:31,536 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:49:31,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:31,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2020-10-19 18:49:31,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:31,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356855522] [2020-10-19 18:49:31,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:31,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:31,544 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:31,546 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:31,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:49:31,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-19 18:49:31,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-19 18:49:31,604 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 12 states. [2020-10-19 18:49:31,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:49:31,840 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2020-10-19 18:49:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 18:49:31,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2020-10-19 18:49:31,842 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 18:49:31,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 46 transitions. [2020-10-19 18:49:31,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-19 18:49:31,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-19 18:49:31,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2020-10-19 18:49:31,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:49:31,845 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-10-19 18:49:31,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2020-10-19 18:49:31,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2020-10-19 18:49:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-19 18:49:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2020-10-19 18:49:31,849 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-19 18:49:31,849 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-19 18:49:31,849 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 18:49:31,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2020-10-19 18:49:31,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 18:49:31,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:49:31,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:49:31,851 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:49:31,852 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-10-19 18:49:31,852 INFO L794 eck$LassoCheckResult]: Stem: 717#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 711#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; 712#L367 assume !(main_~length~0 < 1); 722#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 723#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 724#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); 713#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; 714#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 730#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); 731#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; 725#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 726#L370-3 assume !(main_~i~0 < main_~length~0); 715#L370-4 main_~j~0 := 0; 716#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); 718#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; 719#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); 720#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; 727#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); 743#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; 741#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; 736#L378-2 [2020-10-19 18:49:31,852 INFO L796 eck$LassoCheckResult]: Loop: 736#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); 732#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; 733#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); 737#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; 736#L378-2 [2020-10-19 18:49:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:31,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1142942490, now seen corresponding path program 6 times [2020-10-19 18:49:31,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:31,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939734131] [2020-10-19 18:49:31,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:31,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:31,915 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:31,919 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:31,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:31,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2020-10-19 18:49:31,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:31,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930661052] [2020-10-19 18:49:31,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:31,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:31,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:31,932 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:49:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash -227346514, now seen corresponding path program 7 times [2020-10-19 18:49:31,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:49:31,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918503063] [2020-10-19 18:49:31,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:49:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:31,968 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:49:31,997 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:49:32,001 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:49:32,650 WARN L193 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 134 [2020-10-19 18:49:33,522 WARN L193 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 79 [2020-10-19 18:49:33,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:49:33 BoogieIcfgContainer [2020-10-19 18:49:33,561 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:49:33,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:49:33,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:49:33,562 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:49:33,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:49:22" (3/4) ... [2020-10-19 18:49:33,566 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-19 18:49:33,617 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-19 18:49:33,617 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:49:33,619 INFO L168 Benchmark]: Toolchain (without parser) took 11810.35 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.0 MB). Free memory was 958.6 MB in the beginning and 1.2 GB in the end (delta: -285.8 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2020-10-19 18:49:33,620 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:49:33,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2020-10-19 18:49:33,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2020-10-19 18:49:33,622 INFO L168 Benchmark]: Boogie Preprocessor took 39.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:49:33,625 INFO L168 Benchmark]: RCFGBuilder took 313.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2020-10-19 18:49:33,626 INFO L168 Benchmark]: BuchiAutomizer took 10719.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -171.2 MB). Peak memory consumption was 447.5 MB. Max. memory is 11.5 GB. [2020-10-19 18:49:33,627 INFO L168 Benchmark]: Witness Printer took 56.39 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2020-10-19 18:49:33,630 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 621.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 313.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10719.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -171.2 MB). Peak memory consumption was 447.5 MB. Max. memory is 11.5 GB. * Witness Printer took 56.39 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -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 12 locations. The remainder module has 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.6s and 8 iterations. TraceHistogramMax:4. Analysis of lassos took 9.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. 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: 79 SDtfs, 101 SDslu, 93 SDs, 0 SdLazy, 198 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital295 mio100 ax100 hnf98 lsp115 ukn62 mio100 lsp62 div136 bol100 ite100 ukn100 eq164 hnf73 smp71 dnf155 smp82 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms 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 {NULL=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1013c6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d4ee631=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5dd861b=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@1011519e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5dd861b=2, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@346c1f73=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@656642bd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@6557992c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@121b49a9=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