./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array14_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c 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/array14_alloca.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 519b4f74907cdda12f126cdccb2c6422dda5240e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-f470102 [2019-11-28 20:35:42,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:35:42,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:35:42,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:35:42,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:35:42,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:35:42,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:35:42,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:35:42,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:35:42,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:35:42,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:35:42,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:35:42,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:35:42,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:35:42,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:35:42,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:35:42,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:35:42,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:35:42,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:35:42,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:35:42,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:35:42,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:35:42,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:35:42,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:35:42,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:35:42,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:35:42,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:35:42,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:35:42,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:35:42,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:35:42,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:35:42,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:35:42,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:35:42,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:35:42,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:35:42,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:35:42,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:35:42,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:35:42,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:35:42,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:35:42,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:35:42,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:35:42,522 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:35:42,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:35:42,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:35:42,524 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:35:42,524 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:35:42,525 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:35:42,525 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:35:42,525 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:35:42,525 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:35:42,526 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:35:42,526 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:35:42,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:35:42,526 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:35:42,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:35:42,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:35:42,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:35:42,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:35:42,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:35:42,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:35:42,528 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:35:42,528 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:35:42,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:35:42,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:35:42,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:35:42,529 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:35:42,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:35:42,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:35:42,530 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:35:42,530 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:35:42,531 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:35:42,531 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 -> 519b4f74907cdda12f126cdccb2c6422dda5240e [2019-11-28 20:35:42,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:35:42,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:35:42,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:35:42,862 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:35:42,863 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:35:42,864 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array14_alloca.i [2019-11-28 20:35:42,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce1f52294/6cc460f62f984f00bc4c620d7063ca18/FLAGd4d51f1f1 [2019-11-28 20:35:43,506 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:35:43,506 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array14_alloca.i [2019-11-28 20:35:43,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce1f52294/6cc460f62f984f00bc4c620d7063ca18/FLAGd4d51f1f1 [2019-11-28 20:35:43,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce1f52294/6cc460f62f984f00bc4c620d7063ca18 [2019-11-28 20:35:43,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:35:43,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:35:43,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:35:43,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:35:43,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:35:43,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:35:43" (1/1) ... [2019-11-28 20:35:43,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd431ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:43, skipping insertion in model container [2019-11-28 20:35:43,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:35:43" (1/1) ... [2019-11-28 20:35:43,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:35:43,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:35:44,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:35:44,264 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:35:44,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:35:44,392 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:35:44,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:44 WrapperNode [2019-11-28 20:35:44,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:35:44,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:35:44,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:35:44,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:35:44,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:44" (1/1) ... [2019-11-28 20:35:44,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:44" (1/1) ... [2019-11-28 20:35:44,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:35:44,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:35:44,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:35:44,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:35:44,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:44" (1/1) ... [2019-11-28 20:35:44,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:44" (1/1) ... [2019-11-28 20:35:44,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:44" (1/1) ... [2019-11-28 20:35:44,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:44" (1/1) ... [2019-11-28 20:35:44,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:44" (1/1) ... [2019-11-28 20:35:44,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:44" (1/1) ... [2019-11-28 20:35:44,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:44" (1/1) ... [2019-11-28 20:35:44,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:35:44,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:35:44,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:35:44,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:35:44,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:44" (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 [2019-11-28 20:35:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:35:44,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:35:44,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:35:44,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:35:44,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:35:44,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:35:44,842 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:35:44,843 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 20:35:44,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:35:44 BoogieIcfgContainer [2019-11-28 20:35:44,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:35:44,845 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:35:44,845 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:35:44,850 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:35:44,851 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:35:44,851 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:35:43" (1/3) ... [2019-11-28 20:35:44,852 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@598b5327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:35:44, skipping insertion in model container [2019-11-28 20:35:44,852 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:35:44,852 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:44" (2/3) ... [2019-11-28 20:35:44,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@598b5327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:35:44, skipping insertion in model container [2019-11-28 20:35:44,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:35:44,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:35:44" (3/3) ... [2019-11-28 20:35:44,862 INFO L371 chiAutomizerObserver]: Analyzing ICFG array14_alloca.i [2019-11-28 20:35:44,911 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:35:44,912 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:35:44,912 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:35:44,912 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:35:44,912 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:35:44,913 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:35:44,913 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:35:44,913 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:35:44,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 20:35:44,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 20:35:44,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:44,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:44,952 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:35:44,953 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:35:44,953 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:35:44,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 20:35:44,955 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 20:35:44,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:44,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:44,955 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:35:44,955 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:35:44,962 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 [2019-11-28 20:35:44,962 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 main_#t~mem209 > 0;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 [2019-11-28 20:35:44,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:44,968 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-28 20:35:44,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:44,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580312125] [2019-11-28 20:35:44,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:45,136 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:45,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:45,137 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-11-28 20:35:45,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:45,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754128810] [2019-11-28 20:35:45,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:45,176 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:45,179 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-11-28 20:35:45,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:45,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88818166] [2019-11-28 20:35:45,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:45,265 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:45,500 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-11-28 20:35:45,550 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:35:45,551 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:35:45,552 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:35:45,552 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:35:45,552 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:35:45,553 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:45,553 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:35:45,553 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:35:45,553 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration1_Lasso [2019-11-28 20:35:45,554 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:35:45,554 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:35:45,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:45,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:45,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:45,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:45,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:45,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:45,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:45,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:45,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:45,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:45,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:45,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:46,030 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:35:46,036 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) [2019-11-28 20:35:46,045 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:46,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:46,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:46,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:46,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:46,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:46,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:46,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:46,055 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 [2019-11-28 20:35:46,078 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 [2019-11-28 20:35:46,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:46,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:46,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:46,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:46,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:46,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:46,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:46,089 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 [2019-11-28 20:35:46,104 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 [2019-11-28 20:35:46,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:46,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:46,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:46,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:46,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:46,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:46,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:46,114 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) [2019-11-28 20:35:46,132 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 [2019-11-28 20:35:46,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:46,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:46,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:46,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:46,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:46,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:46,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:46,138 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) [2019-11-28 20:35:46,155 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 [2019-11-28 20:35:46,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:46,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:46,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:46,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:46,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:46,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:46,171 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) [2019-11-28 20:35:46,181 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 [2019-11-28 20:35:46,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:46,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:46,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:46,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:46,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:46,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:46,184 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 [2019-11-28 20:35:46,187 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) [2019-11-28 20:35:46,201 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 [2019-11-28 20:35:46,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:46,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:46,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:46,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:46,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:46,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:46,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:46,207 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:46,226 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 [2019-11-28 20:35:46,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:46,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:46,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:46,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:46,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:46,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:46,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:46,234 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:46,247 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 [2019-11-28 20:35:46,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:46,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:46,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:46,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:46,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:46,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:46,262 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) [2019-11-28 20:35:46,274 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 [2019-11-28 20:35:46,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:46,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:46,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:46,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:46,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:46,299 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:46,319 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:35:46,378 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 20:35:46,378 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. 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) [2019-11-28 20:35:46,396 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:46,400 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:35:46,401 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:35:46,402 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1) = -4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~length~0 >= 0] [2019-11-28 20:35:46,425 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 20:35:46,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:35:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:46,508 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:35:46,511 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:46,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 20:35:46,570 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:35:46,581 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:35:46,581 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:35:46,582 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 20:35:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:46,624 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:35:46,625 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:46,670 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:35:46,672 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-11-28 20:35:46,786 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 32 states and 47 transitions. Complement of second has 9 states. [2019-11-28 20:35:46,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:35:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2019-11-28 20:35:46,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-28 20:35:46,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:46,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-28 20:35:46,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:46,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-28 20:35:46,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:46,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2019-11-28 20:35:46,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:35:46,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 17 transitions. [2019-11-28 20:35:46,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:35:46,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:35:46,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-11-28 20:35:46,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:35:46,808 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-28 20:35:46,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-11-28 20:35:46,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-28 20:35:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 20:35:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-11-28 20:35:46,840 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-28 20:35:46,840 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-28 20:35:46,840 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:35:46,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-11-28 20:35:46,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:35:46,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:46,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:46,842 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:35:46,843 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:35:46,843 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 125#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; 126#L367 assume !(main_~length~0 < 1); 131#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; 132#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 133#L370-3 assume !(main_~i~0 < main_~length~0); 127#L370-4 main_~j~0 := 0; 128#L378-2 [2019-11-28 20:35:46,843 INFO L796 eck$LassoCheckResult]: Loop: 128#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); 130#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 128#L378-2 [2019-11-28 20:35:46,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:46,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-11-28 20:35:46,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:46,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932363185] [2019-11-28 20:35:46,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:46,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932363185] [2019-11-28 20:35:46,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:35:46,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:35:46,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161266559] [2019-11-28 20:35:46,919 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:35:46,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:46,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-11-28 20:35:46,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:46,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711122019] [2019-11-28 20:35:46,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:46,947 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:46,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:35:46,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:35:46,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:35:46,997 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-28 20:35:47,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:35:47,043 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-28 20:35:47,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:35:47,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-28 20:35:47,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:35:47,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-28 20:35:47,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 20:35:47,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:35:47,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-28 20:35:47,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:35:47,054 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 20:35:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-28 20:35:47,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-28 20:35:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 20:35:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-28 20:35:47,057 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 20:35:47,059 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 20:35:47,059 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:35:47,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-28 20:35:47,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:35:47,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:47,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:47,061 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:35:47,061 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:35:47,062 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#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; 157#L367 assume !(main_~length~0 < 1); 164#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; 165#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 166#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); 158#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 159#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 167#L370-3 assume !(main_~i~0 < main_~length~0); 160#L370-4 main_~j~0 := 0; 161#L378-2 [2019-11-28 20:35:47,063 INFO L796 eck$LassoCheckResult]: Loop: 161#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); 163#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 161#L378-2 [2019-11-28 20:35:47,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:47,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-11-28 20:35:47,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:47,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443245074] [2019-11-28 20:35:47,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:47,114 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:47,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:47,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-11-28 20:35:47,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:47,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786300772] [2019-11-28 20:35:47,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:47,134 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:47,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:47,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-11-28 20:35:47,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:47,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960435326] [2019-11-28 20:35:47,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:47,207 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:47,406 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-11-28 20:35:47,468 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:35:47,468 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:35:47,469 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:35:47,469 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:35:47,469 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:35:47,469 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:47,469 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:35:47,469 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:35:47,470 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration3_Lasso [2019-11-28 20:35:47,470 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:35:47,470 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:35:47,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:47,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:47,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:47,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:47,617 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-11-28 20:35:47,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:47,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:47,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:47,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:47,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:47,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:47,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:47,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:47,917 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:35:47,917 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 20:35:47,922 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 [2019-11-28 20:35:47,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:47,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:47,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:47,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:47,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:47,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:47,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:47,932 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 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:47,941 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 [2019-11-28 20:35:47,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:47,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:47,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:47,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:47,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:47,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:47,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:47,945 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 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:47,953 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 [2019-11-28 20:35:47,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:47,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:47,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:47,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:47,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:47,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:47,962 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 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:47,971 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 [2019-11-28 20:35:47,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:47,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:47,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:47,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:47,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:47,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:47,984 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:47,996 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 [2019-11-28 20:35:47,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:47,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:47,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:47,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:48,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:48,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:48,005 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) [2019-11-28 20:35:48,023 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 [2019-11-28 20:35:48,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:48,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:48,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:48,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:48,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:48,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:48,045 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:35:48,165 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 20:35:48,166 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. 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 [2019-11-28 20:35:48,175 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:35:48,178 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:35:48,178 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:35:48,179 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2) = 8*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2 Supporting invariants [] [2019-11-28 20:35:48,190 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 20:35:48,192 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:35:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:48,225 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:35:48,226 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:48,238 WARN L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:35:48,238 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:48,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:48,263 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:35:48,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-28 20:35:48,306 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 16 states and 22 transitions. Complement of second has 6 states. [2019-11-28 20:35:48,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:35:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 20:35:48,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-28 20:35:48,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:48,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-28 20:35:48,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:48,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 20:35:48,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:48,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-28 20:35:48,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:35:48,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-11-28 20:35:48,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:35:48,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:35:48,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-28 20:35:48,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:35:48,312 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 20:35:48,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-28 20:35:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-28 20:35:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 20:35:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-28 20:35:48,318 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 20:35:48,318 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 20:35:48,318 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:35:48,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-28 20:35:48,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:35:48,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:48,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:48,320 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:35:48,320 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:35:48,320 INFO L794 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 260#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; 261#L367 assume !(main_~length~0 < 1); 272#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; 273#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 274#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); 262#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 263#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 275#L370-3 assume !(main_~i~0 < main_~length~0); 264#L370-4 main_~j~0 := 0; 265#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); 271#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 267#L378-2 [2019-11-28 20:35:48,321 INFO L796 eck$LassoCheckResult]: Loop: 267#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); 268#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 267#L378-2 [2019-11-28 20:35:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-11-28 20:35:48,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:48,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716018107] [2019-11-28 20:35:48,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:48,345 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:48,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:48,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-11-28 20:35:48,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:48,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47811019] [2019-11-28 20:35:48,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:48,354 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:48,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:48,355 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-11-28 20:35:48,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:48,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650155102] [2019-11-28 20:35:48,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:48,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650155102] [2019-11-28 20:35:48,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982535529] [2019-11-28 20:35:48,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:35:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:48,532 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:35:48,534 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:48,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:35:48,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-28 20:35:48,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571148079] [2019-11-28 20:35:48,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:35:48,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:35:48,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:35:48,661 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-11-28 20:35:48,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:35:48,880 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-11-28 20:35:48,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:35:48,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2019-11-28 20:35:48,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:35:48,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 28 transitions. [2019-11-28 20:35:48,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:35:48,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:35:48,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2019-11-28 20:35:48,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:35:48,883 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-28 20:35:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2019-11-28 20:35:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-28 20:35:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 20:35:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-28 20:35:48,886 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-28 20:35:48,886 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-28 20:35:48,886 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:35:48,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-28 20:35:48,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:35:48,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:48,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:48,888 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:35:48,888 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:35:48,888 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 376#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; 377#L367 assume !(main_~length~0 < 1); 386#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; 387#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 388#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); 391#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 389#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 390#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); 374#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 375#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 392#L370-3 assume !(main_~i~0 < main_~length~0); 378#L370-4 main_~j~0 := 0; 379#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); 385#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 381#L378-2 [2019-11-28 20:35:48,889 INFO L796 eck$LassoCheckResult]: Loop: 381#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); 382#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 381#L378-2 [2019-11-28 20:35:48,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:48,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2019-11-28 20:35:48,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:48,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637994168] [2019-11-28 20:35:48,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:48,919 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:48,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:48,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-11-28 20:35:48,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:48,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456752612] [2019-11-28 20:35:48,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:48,928 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:48,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:48,929 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2019-11-28 20:35:48,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:48,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320170252] [2019-11-28 20:35:48,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:48,961 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:49,275 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 91 [2019-11-28 20:35:49,341 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:35:49,341 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:35:49,342 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:35:49,342 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:35:49,342 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:35:49,342 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:49,342 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:35:49,342 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:35:49,343 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration5_Lasso [2019-11-28 20:35:49,343 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:35:49,343 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:35:49,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:49,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:49,510 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-28 20:35:49,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:49,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:49,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:49,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:49,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:49,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:49,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:49,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:49,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:49,851 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:35:49,851 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2019-11-28 20:35:49,860 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 [2019-11-28 20:35:49,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:49,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:49,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:49,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:49,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:49,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:49,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:49,880 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:49,892 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 [2019-11-28 20:35:49,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:49,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:49,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:49,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:49,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:49,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:49,906 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 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:49,925 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 [2019-11-28 20:35:49,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:49,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:49,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:49,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:49,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:49,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:49,952 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:35:50,028 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2019-11-28 20:35:50,028 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:50,034 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:50,036 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:35:50,037 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:35:50,037 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_3) = 8*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_3 Supporting invariants [] [2019-11-28 20:35:50,052 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 20:35:50,055 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:35:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:50,094 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:35:50,097 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:50,108 WARN L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:35:50,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:50,125 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:35:50,126 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 20:35:50,177 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 23 states and 31 transitions. Complement of second has 6 states. [2019-11-28 20:35:50,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:35:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-28 20:35:50,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-28 20:35:50,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:50,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-28 20:35:50,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:50,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 20:35:50,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:50,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2019-11-28 20:35:50,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:35:50,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2019-11-28 20:35:50,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 20:35:50,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:35:50,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2019-11-28 20:35:50,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:35:50,184 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-28 20:35:50,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2019-11-28 20:35:50,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 20:35:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 20:35:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-28 20:35:50,187 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-28 20:35:50,188 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-28 20:35:50,188 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:35:50,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-11-28 20:35:50,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:35:50,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:50,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:50,190 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:35:50,190 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:35:50,191 INFO L794 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 513#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; 514#L367 assume !(main_~length~0 < 1); 523#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; 524#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 525#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); 529#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 526#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 527#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); 511#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 512#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 530#L370-3 assume !(main_~i~0 < main_~length~0); 515#L370-4 main_~j~0 := 0; 516#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); 522#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 528#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); 531#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 518#L378-2 [2019-11-28 20:35:50,191 INFO L796 eck$LassoCheckResult]: Loop: 518#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); 519#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 518#L378-2 [2019-11-28 20:35:50,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:50,191 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2019-11-28 20:35:50,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:50,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885717767] [2019-11-28 20:35:50,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:50,244 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:50,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:50,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-11-28 20:35:50,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:50,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422246901] [2019-11-28 20:35:50,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:50,262 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:50,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:50,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2019-11-28 20:35:50,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:50,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369221729] [2019-11-28 20:35:50,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:50,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369221729] [2019-11-28 20:35:50,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986586940] [2019-11-28 20:35:50,411 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 20:35:50,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 20:35:50,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:35:50,473 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:35:50,475 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:50,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:35:50,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-28 20:35:50,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855757289] [2019-11-28 20:35:50,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:35:50,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 20:35:50,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:35:50,605 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 17 states. [2019-11-28 20:35:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:35:50,827 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-11-28 20:35:50,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:35:50,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-11-28 20:35:50,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 20:35:50,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 60 transitions. [2019-11-28 20:35:50,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-28 20:35:50,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-28 20:35:50,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2019-11-28 20:35:50,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:35:50,834 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2019-11-28 20:35:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2019-11-28 20:35:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-11-28 20:35:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:35:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2019-11-28 20:35:50,839 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-28 20:35:50,839 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-28 20:35:50,839 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:35:50,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2019-11-28 20:35:50,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:35:50,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:50,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:50,841 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:35:50,841 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-28 20:35:50,842 INFO L794 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 664#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; 665#L367 assume !(main_~length~0 < 1); 676#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; 677#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 678#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); 684#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 687#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 685#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); 686#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 679#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 680#L370-3 assume !(main_~i~0 < main_~length~0); 668#L370-4 main_~j~0 := 0; 669#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); 689#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 688#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); 682#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 683#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); 697#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 695#L378-2 [2019-11-28 20:35:50,842 INFO L796 eck$LassoCheckResult]: Loop: 695#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); 692#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 671#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); 672#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 695#L378-2 [2019-11-28 20:35:50,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:50,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2019-11-28 20:35:50,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:50,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460210195] [2019-11-28 20:35:50,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:50,866 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:50,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:50,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-11-28 20:35:50,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:50,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578599988] [2019-11-28 20:35:50,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:50,874 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2019-11-28 20:35:50,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:50,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445906020] [2019-11-28 20:35:50,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:50,918 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:51,408 WARN L192 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 105 [2019-11-28 20:35:51,521 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-28 20:35:51,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:35:51 BoogieIcfgContainer [2019-11-28 20:35:51,553 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:35:51,553 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:35:51,553 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:35:51,553 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:35:51,554 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:35:44" (3/4) ... [2019-11-28 20:35:51,557 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 20:35:51,630 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:35:51,630 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:35:51,634 INFO L168 Benchmark]: Toolchain (without parser) took 7859.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 117.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:35:51,635 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:35:51,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:35:51,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.64 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.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:35:51,642 INFO L168 Benchmark]: Boogie Preprocessor took 23.82 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:35:51,643 INFO L168 Benchmark]: RCFGBuilder took 357.96 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:35:51,643 INFO L168 Benchmark]: BuchiAutomizer took 6707.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 153.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.1 MB). Peak memory consumption was 108.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:35:51,643 INFO L168 Benchmark]: Witness Printer took 77.33 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:35:51,647 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 620.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.64 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.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.82 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 357.96 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6707.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 153.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.1 MB). Peak memory consumption was 108.0 MB. Max. memory is 11.5 GB. * Witness Printer took 77.33 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 6 locations. One deterministic module has affine ranking function 8 * j + unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 4 locations. One deterministic module has affine ranking function 8 * j + unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 5.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 51 SDtfs, 161 SDslu, 76 SDs, 0 SdLazy, 230 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital130 mio100 ax100 hnf99 lsp93 ukn82 mio100 lsp63 div100 bol100 ite100 ukn100 eq159 hnf90 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms 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@62ec5243=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23b9c7d9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@416f6507=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@103abb07=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@416f6507=2, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@4770dd9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@28da4e3e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@6a0a95b9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@7ba1707=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 0) [L370] i++ [L370] COND TRUE i 0) [L370] i++ [L370] COND FALSE !(i