./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/array04_alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-15/array04_alloca_false-termination.c.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 ede187b1b02320b6ac4ee708403ec99e5631a2e0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-91b1670 [2018-11-28 23:23:49,385 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:23:49,387 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:23:49,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:23:49,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:23:49,401 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:23:49,406 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:23:49,408 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:23:49,412 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:23:49,413 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:23:49,415 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:23:49,416 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:23:49,417 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:23:49,419 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:23:49,424 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:23:49,426 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:23:49,428 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:23:49,432 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:23:49,441 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:23:49,446 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:23:49,447 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:23:49,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:23:49,456 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:23:49,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:23:49,459 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:23:49,460 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:23:49,461 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:23:49,466 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:23:49,467 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:23:49,468 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:23:49,468 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:23:49,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:23:49,472 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:23:49,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:23:49,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:23:49,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:23:49,474 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:23:49,503 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:23:49,503 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:23:49,506 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:23:49,506 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:23:49,506 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:23:49,506 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:23:49,506 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:23:49,506 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:23:49,507 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:23:49,507 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:23:49,507 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:23:49,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:23:49,507 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:23:49,507 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:23:49,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:23:49,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:23:49,509 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:23:49,509 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:23:49,509 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:23:49,509 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:23:49,509 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:23:49,510 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:23:49,510 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:23:49,510 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:23:49,510 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:23:49,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:23:49,510 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:23:49,512 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:23:49,513 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:23:49,513 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> ede187b1b02320b6ac4ee708403ec99e5631a2e0 [2018-11-28 23:23:49,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:23:49,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:23:49,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:23:49,588 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:23:49,589 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:23:49,589 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/array04_alloca_false-termination.c.i [2018-11-28 23:23:49,652 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04568ff2b/59ca32fca55a4976832f4821761e697e/FLAG4958a2a7d [2018-11-28 23:23:50,180 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:23:50,181 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/array04_alloca_false-termination.c.i [2018-11-28 23:23:50,192 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04568ff2b/59ca32fca55a4976832f4821761e697e/FLAG4958a2a7d [2018-11-28 23:23:50,469 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04568ff2b/59ca32fca55a4976832f4821761e697e [2018-11-28 23:23:50,474 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:23:50,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:23:50,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:23:50,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:23:50,481 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:23:50,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:50" (1/1) ... [2018-11-28 23:23:50,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72edbfe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:50, skipping insertion in model container [2018-11-28 23:23:50,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:50" (1/1) ... [2018-11-28 23:23:50,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:23:50,543 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:23:50,951 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:23:50,966 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:23:51,041 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:23:51,154 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:23:51,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51 WrapperNode [2018-11-28 23:23:51,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:23:51,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:23:51,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:23:51,155 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:23:51,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:51,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:51,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:23:51,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:23:51,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:23:51,309 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:23:51,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:51,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:51,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:51,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:51,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:51,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:51,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:51,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:23:51,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:23:51,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:23:51,340 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:23:51,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (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 [2018-11-28 23:23:51,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:23:51,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:23:51,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:23:51,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:23:51,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:23:51,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:23:51,727 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:23:51,727 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 23:23:51,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:51 BoogieIcfgContainer [2018-11-28 23:23:51,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:23:51,728 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:23:51,729 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:23:51,740 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:23:51,742 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:51,743 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:23:50" (1/3) ... [2018-11-28 23:23:51,745 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@90d1554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:51, skipping insertion in model container [2018-11-28 23:23:51,745 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:51,745 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (2/3) ... [2018-11-28 23:23:51,746 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@90d1554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:51, skipping insertion in model container [2018-11-28 23:23:51,746 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:51,748 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:51" (3/3) ... [2018-11-28 23:23:51,751 INFO L375 chiAutomizerObserver]: Analyzing ICFG array04_alloca_false-termination.c.i [2018-11-28 23:23:51,879 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:23:51,880 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:23:51,880 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:23:51,880 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:23:51,880 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:23:51,881 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:23:51,881 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:23:51,881 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:23:51,881 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:23:51,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:23:51,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-28 23:23:51,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:51,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:51,931 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:23:51,931 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:23:51,931 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:23:51,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:23:51,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-28 23:23:51,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:51,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:51,934 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:23:51,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:23:51,943 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, 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; 14#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 11#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 15#L370-3true [2018-11-28 23:23:51,944 INFO L796 eck$LassoCheckResult]: Loop: 15#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; 13#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L370-3true [2018-11-28 23:23:51,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:51,950 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-28 23:23:51,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:51,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:52,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:52,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:52,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2018-11-28 23:23:52,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:52,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:52,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:52,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:52,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2018-11-28 23:23:52,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:52,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:52,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:52,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,579 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-11-28 23:23:52,678 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:23:52,679 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:23:52,680 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:23:52,680 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:23:52,680 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:23:52,680 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:52,681 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:23:52,681 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:23:52,681 INFO L131 ssoRankerPreferences]: Filename of dumped script: array04_alloca_false-termination.c.i_Iteration1_Lasso [2018-11-28 23:23:52,681 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:23:52,681 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:23:52,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:52,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:52,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:52,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,023 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-11-28 23:23:53,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,228 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 23:23:53,761 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:23:53,767 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:23:53,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:53,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:53,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:53,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:53,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:53,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:53,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:53,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:53,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:53,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:53,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:53,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:53,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:53,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:53,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:53,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:53,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:53,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:53,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:53,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:53,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:53,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:53,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:53,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:53,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:53,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:53,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:53,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:53,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:53,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:53,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:53,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:53,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:53,914 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:23:53,990 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:23:53,991 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:23:53,993 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:23:53,996 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:23:53,996 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:23:53,997 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-28 23:23:54,076 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:23:54,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:54,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:54,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:54,308 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:23:54,310 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2018-11-28 23:23:54,401 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 7 states. [2018-11-28 23:23:54,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:23:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:23:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-28 23:23:54,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:23:54,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:54,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:23:54,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:54,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:23:54,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:54,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-11-28 23:23:54,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:23:54,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 10 states and 13 transitions. [2018-11-28 23:23:54,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:23:54,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:23:54,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-28 23:23:54,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:23:54,420 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:23:54,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-28 23:23:54,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 23:23:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:23:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 23:23:54,446 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:23:54,446 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:23:54,446 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:23:54,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-28 23:23:54,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:23:54,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:54,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:54,448 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:54,448 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:23:54,449 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, 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; 105#L367 assume !(main_~length~0 < 1); 108#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 109#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 110#L370-3 assume !(main_~i~0 < main_~length~0); 106#L370-4 main_~j~0 := 0; 103#L374-2 [2018-11-28 23:23:54,450 INFO L796 eck$LassoCheckResult]: Loop: 103#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_~j~0 := main_~j~0 + main_#t~mem209;havoc main_#t~mem209; 103#L374-2 [2018-11-28 23:23:54,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:54,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2018-11-28 23:23:54,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:54,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:54,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:54,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:54,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:54,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:23:54,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:23:54,538 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:23:54,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2018-11-28 23:23:54,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:54,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:54,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:54,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:54,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:54,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:23:54,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:23:54,599 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-28 23:23:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:23:54,635 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-11-28 23:23:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:23:54,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-11-28 23:23:54,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:23:54,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2018-11-28 23:23:54,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:23:54,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:23:54,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-28 23:23:54,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:23:54,640 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-28 23:23:54,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-28 23:23:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-28 23:23:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:23:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-28 23:23:54,642 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 23:23:54,642 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 23:23:54,642 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:23:54,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-28 23:23:54,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:23:54,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:54,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:54,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:54,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:23:54,645 INFO L794 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, 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; 133#L367 assume !(main_~length~0 < 1); 136#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 137#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#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; 139#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 140#L370-3 assume !(main_~i~0 < main_~length~0); 134#L370-4 main_~j~0 := 0; 131#L374-2 [2018-11-28 23:23:54,645 INFO L796 eck$LassoCheckResult]: Loop: 131#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_~j~0 := main_~j~0 + main_#t~mem209;havoc main_#t~mem209; 131#L374-2 [2018-11-28 23:23:54,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:54,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2018-11-28 23:23:54,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:54,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:54,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:54,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:54,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:54,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:54,667 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2018-11-28 23:23:54,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:54,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:54,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:54,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:54,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:54,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2018-11-28 23:23:54,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:54,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:54,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:54,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:54,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:55,143 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-11-28 23:23:55,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:23:55 BoogieIcfgContainer [2018-11-28 23:23:55,241 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:23:55,242 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:23:55,242 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:23:55,242 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:23:55,244 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:51" (3/4) ... [2018-11-28 23:23:55,257 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 23:23:55,325 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:23:55,325 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:23:55,326 INFO L168 Benchmark]: Toolchain (without parser) took 4852.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 952.7 MB in the beginning and 940.0 MB in the end (delta: 12.7 MB). Peak memory consumption was 138.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:55,328 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:23:55,329 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.29 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:55,329 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:55,332 INFO L168 Benchmark]: Boogie Preprocessor took 30.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:23:55,333 INFO L168 Benchmark]: RCFGBuilder took 388.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:55,335 INFO L168 Benchmark]: BuchiAutomizer took 3513.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 940.0 MB in the end (delta: 153.5 MB). Peak memory consumption was 153.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:55,337 INFO L168 Benchmark]: Witness Printer took 83.43 ms. Allocated memory is still 1.2 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:23:55,343 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 678.29 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 153.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 388.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3513.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 940.0 MB in the end (delta: 153.5 MB). Peak memory consumption was 153.5 MB. Max. memory is 11.5 GB. * Witness Printer took 83.43 ms. Allocated memory is still 1.2 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 19 SDtfs, 24 SDslu, 10 SDs, 0 SdLazy, 25 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax100 hnf98 lsp93 ukn82 mio100 lsp66 div100 bol100 ite100 ukn100 eq167 hnf91 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms 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: 374]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {NULL=0, \result=0, arr=5, arr=0, i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5113a722=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1da9a7b3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@144721c5=0, length=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@60837d50=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@144721c5=5, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1ce49d04=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 374]: 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