./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/array15_alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/array15_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 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2019-01-01 22:05:18,714 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:05:18,716 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:05:18,733 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:05:18,734 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:05:18,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:05:18,738 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:05:18,741 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:05:18,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:05:18,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:05:18,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:05:18,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:05:18,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:05:18,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:05:18,760 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:05:18,761 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:05:18,762 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:05:18,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:05:18,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:05:18,775 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:05:18,777 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:05:18,782 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:05:18,785 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:05:18,787 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:05:18,787 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:05:18,788 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:05:18,789 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:05:18,790 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:05:18,790 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:05:18,791 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:05:18,791 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:05:18,796 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:05:18,797 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:05:18,797 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:05:18,798 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:05:18,798 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:05:18,800 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:05:18,820 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:05:18,821 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:05:18,822 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:05:18,822 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:05:18,822 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:05:18,823 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:05:18,823 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:05:18,823 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:05:18,823 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:05:18,823 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:05:18,824 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:05:18,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:05:18,824 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:05:18,824 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:05:18,824 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:05:18,824 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:05:18,825 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:05:18,825 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:05:18,825 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:05:18,825 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:05:18,825 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:05:18,826 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:05:18,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:05:18,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:05:18,826 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:05:18,826 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:05:18,826 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:05:18,827 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:05:18,829 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:05:18,829 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 -> 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 [2019-01-01 22:05:18,896 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:05:18,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:05:18,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:05:18,927 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:05:18,928 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:05:18,928 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/array15_alloca_false-termination.c.i [2019-01-01 22:05:18,992 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe993d9b/f42914538c2a4ce8b35ee7e743b24c14/FLAG9fe6b8651 [2019-01-01 22:05:19,477 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:05:19,478 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/array15_alloca_false-termination.c.i [2019-01-01 22:05:19,499 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe993d9b/f42914538c2a4ce8b35ee7e743b24c14/FLAG9fe6b8651 [2019-01-01 22:05:19,792 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe993d9b/f42914538c2a4ce8b35ee7e743b24c14 [2019-01-01 22:05:19,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:05:19,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:05:19,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:05:19,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:05:19,802 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:05:19,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:05:19" (1/1) ... [2019-01-01 22:05:19,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6605ba18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:19, skipping insertion in model container [2019-01-01 22:05:19,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:05:19" (1/1) ... [2019-01-01 22:05:19,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:05:19,866 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:05:20,293 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:05:20,310 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:05:20,386 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:05:20,573 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:05:20,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:20 WrapperNode [2019-01-01 22:05:20,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:05:20,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:05:20,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:05:20,576 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:05:20,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:20" (1/1) ... [2019-01-01 22:05:20,610 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:20" (1/1) ... [2019-01-01 22:05:20,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:05:20,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:05:20,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:05:20,642 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:05:20,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:20" (1/1) ... [2019-01-01 22:05:20,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:20" (1/1) ... [2019-01-01 22:05:20,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:20" (1/1) ... [2019-01-01 22:05:20,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:20" (1/1) ... [2019-01-01 22:05:20,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:20" (1/1) ... [2019-01-01 22:05:20,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:20" (1/1) ... [2019-01-01 22:05:20,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:20" (1/1) ... [2019-01-01 22:05:20,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:05:20,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:05:20,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:05:20,685 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:05:20,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:20" (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-01-01 22:05:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:05:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:05:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:05:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:05:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:05:20,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:05:21,133 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:05:21,134 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 22:05:21,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:21 BoogieIcfgContainer [2019-01-01 22:05:21,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:05:21,135 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:05:21,136 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:05:21,140 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:05:21,141 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:21,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:05:19" (1/3) ... [2019-01-01 22:05:21,142 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38678da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:05:21, skipping insertion in model container [2019-01-01 22:05:21,142 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:21,142 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:20" (2/3) ... [2019-01-01 22:05:21,143 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38678da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:05:21, skipping insertion in model container [2019-01-01 22:05:21,143 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:21,143 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:21" (3/3) ... [2019-01-01 22:05:21,145 INFO L375 chiAutomizerObserver]: Analyzing ICFG array15_alloca_false-termination.c.i [2019-01-01 22:05:21,218 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:05:21,219 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:05:21,219 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:05:21,219 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:05:21,219 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:05:21,219 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:05:21,220 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:05:21,220 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:05:21,220 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:05:21,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 22:05:21,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 22:05:21,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:21,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:21,265 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:05:21,265 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:21,265 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:05:21,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 22:05:21,269 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 22:05:21,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:21,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:21,273 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:05:21,273 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:21,282 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.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-01-01 22:05:21,283 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-01-01 22:05:21,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:21,290 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-01 22:05:21,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:21,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:21,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:21,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:21,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:21,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:21,428 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-01-01 22:05:21,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:21,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:21,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:21,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:21,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:21,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:21,455 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-01-01 22:05:21,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:21,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:21,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:21,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:21,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:21,626 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 22:05:21,842 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-01 22:05:22,315 WARN L181 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-01-01 22:05:22,374 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:22,375 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:22,375 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:22,375 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:22,375 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:22,375 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:22,376 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:22,376 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:22,377 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca_false-termination.c.i_Iteration1_Lasso [2019-01-01 22:05:22,377 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:22,377 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:22,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:22,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:22,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:22,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:22,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:22,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:22,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:22,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:22,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:22,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:22,720 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-01 22:05:22,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:22,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:23,047 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-01 22:05:23,217 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 22:05:23,533 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:23,539 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:23,541 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 [2019-01-01 22:05:23,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:23,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:23,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:23,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:23,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:23,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:23,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:23,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:23,550 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 [2019-01-01 22:05:23,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:23,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:23,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:23,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:23,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:23,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:23,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:23,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:23,554 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 [2019-01-01 22:05:23,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:23,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:23,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:23,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:23,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:23,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:23,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:23,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:23,558 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 [2019-01-01 22:05:23,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:23,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:23,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:23,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:23,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:23,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:23,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:23,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:23,561 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 [2019-01-01 22:05:23,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:23,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:23,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:23,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:23,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:23,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:23,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:23,572 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 [2019-01-01 22:05:23,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:23,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:23,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:23,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:23,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:23,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:23,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:23,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:23,576 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 [2019-01-01 22:05:23,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:23,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:23,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:23,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:23,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:23,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:23,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:23,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:23,579 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 [2019-01-01 22:05:23,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:23,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:23,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:23,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:23,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:23,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:23,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:23,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:23,583 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 [2019-01-01 22:05:23,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:23,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:23,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:23,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:23,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:23,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:23,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:23,595 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 [2019-01-01 22:05:23,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:23,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:23,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:23,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:23,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:23,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:23,715 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:23,747 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:05:23,747 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:05:23,753 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:23,756 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:23,759 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:23,761 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2019-01-01 22:05:23,796 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:05:23,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:05:23,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:23,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:23,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:23,953 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 [2019-01-01 22:05:23,954 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-01-01 22:05:24,056 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2019-01-01 22:05:24,057 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 [2019-01-01 22:05:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:05:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-01-01 22:05:24,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 22:05:24,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:24,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 22:05:24,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:24,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-01 22:05:24,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:24,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2019-01-01 22:05:24,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:05:24,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2019-01-01 22:05:24,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 22:05:24,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 22:05:24,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-01-01 22:05:24,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:24,077 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-01 22:05:24,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-01-01 22:05:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-01 22:05:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 22:05:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-01-01 22:05:24,109 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-01 22:05:24,109 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-01 22:05:24,109 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:05:24,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-01-01 22:05:24,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:05:24,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:24,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:24,111 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:24,111 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:05:24,111 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 114#L367 assume !(main_~length~0 < 1); 121#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2019-01-01 22:05:24,112 INFO L796 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume 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; 118#L378-2 [2019-01-01 22:05:24,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:24,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-01-01 22:05:24,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:24,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:24,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:24,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:24,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:24,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:05:24,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:05:24,206 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:05:24,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:24,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-01-01 22:05:24,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:24,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:24,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:24,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:24,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:24,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:05:24,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:05:24,290 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-01 22:05:24,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:24,372 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-01-01 22:05:24,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:05:24,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-01-01 22:05:24,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:05:24,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-01-01 22:05:24,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 22:05:24,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 22:05:24,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-01-01 22:05:24,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:24,376 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-01 22:05:24,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-01-01 22:05:24,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-01-01 22:05:24,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 22:05:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-01 22:05:24,378 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 22:05:24,379 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 22:05:24,379 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:05:24,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-01 22:05:24,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:05:24,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:24,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:24,380 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:24,380 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:05:24,381 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 147#L367 assume !(main_~length~0 < 1); 154#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 148#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2019-01-01 22:05:24,381 INFO L796 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume 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; 151#L378-2 [2019-01-01 22:05:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:24,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-01-01 22:05:24,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:24,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:24,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:24,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:24,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:24,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:24,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-01-01 22:05:24,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:24,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:24,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:24,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:24,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:24,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:24,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-01-01 22:05:24,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:24,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:24,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:24,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:24,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:24,919 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-01-01 22:05:24,995 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:24,995 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:24,995 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:24,995 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:24,996 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:24,996 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:24,996 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:24,996 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:24,997 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca_false-termination.c.i_Iteration3_Lasso [2019-01-01 22:05:24,997 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:24,997 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:25,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:25,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:25,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:25,175 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-01 22:05:25,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:25,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:25,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:25,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:25,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:25,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:25,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:25,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:25,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:25,567 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:25,567 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:25,568 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 [2019-01-01 22:05:25,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:25,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:25,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:25,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:25,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:25,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:25,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:25,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:25,574 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 [2019-01-01 22:05:25,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:25,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:25,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:25,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:25,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:25,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:25,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:25,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:25,578 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 [2019-01-01 22:05:25,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:25,579 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:05:25,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:25,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:25,581 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:05:25,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:25,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:25,592 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 [2019-01-01 22:05:25,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:25,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:25,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:25,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:25,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:25,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:25,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:25,597 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 [2019-01-01 22:05:25,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:25,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:25,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:25,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:25,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:25,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:25,625 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:25,651 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:05:25,651 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 22:05:25,652 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:25,653 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:25,653 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:25,653 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-01-01 22:05:25,690 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:05:25,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:25,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:25,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:25,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:25,865 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 [2019-01-01 22:05:25,865 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 22:05:25,883 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2019-01-01 22:05:25,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:05:25,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:05:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-01-01 22:05:25,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-01 22:05:25,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:25,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-01 22:05:25,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:25,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 22:05:25,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:25,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-01-01 22:05:25,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:05:25,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-01-01 22:05:25,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 22:05:25,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:05:25,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-01-01 22:05:25,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:25,889 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-01 22:05:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-01-01 22:05:25,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-01 22:05:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 22:05:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-01-01 22:05:25,891 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-01 22:05:25,891 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-01 22:05:25,891 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:05:25,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-01-01 22:05:25,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:05:25,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:25,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:25,894 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:25,894 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:05:25,894 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 245#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 246#L367 assume !(main_~length~0 < 1); 255#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 243#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 244#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 258#L370-3 assume !(main_~i~0 < main_~length~0); 247#L370-4 main_~j~0 := 0; 248#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 254#L378 assume !(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; 250#L378-2 [2019-01-01 22:05:25,894 INFO L796 eck$LassoCheckResult]: Loop: 250#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 251#L378 assume 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; 250#L378-2 [2019-01-01 22:05:25,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:25,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-01-01 22:05:25,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:25,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:25,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:25,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:25,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:25,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:25,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-01-01 22:05:25,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:25,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:25,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:25,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:25,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:25,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:25,929 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-01-01 22:05:25,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:25,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:25,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:26,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:05:26,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:05:26,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:26,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:26,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:05:26,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-01-01 22:05:26,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 22:05:26,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-01 22:05:26,444 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 10 states. [2019-01-01 22:05:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:26,820 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2019-01-01 22:05:26,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 22:05:26,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions. [2019-01-01 22:05:26,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:05:26,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 28 transitions. [2019-01-01 22:05:26,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 22:05:26,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:05:26,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2019-01-01 22:05:26,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:26,826 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-01-01 22:05:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2019-01-01 22:05:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-01 22:05:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 22:05:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-01-01 22:05:26,830 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-01 22:05:26,831 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-01 22:05:26,831 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:05:26,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-01-01 22:05:26,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:05:26,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:26,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:26,836 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:26,836 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:05:26,836 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 360#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; 361#L367 assume !(main_~length~0 < 1); 370#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; 371#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 372#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); 375#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 373#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 374#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); 358#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 359#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 376#L370-3 assume !(main_~i~0 < main_~length~0); 362#L370-4 main_~j~0 := 0; 363#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); 369#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; 365#L378-2 [2019-01-01 22:05:26,836 INFO L796 eck$LassoCheckResult]: Loop: 365#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); 366#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; 365#L378-2 [2019-01-01 22:05:26,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:26,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2019-01-01 22:05:26,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:26,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:26,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:26,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:26,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:26,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:26,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-01-01 22:05:26,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:26,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:26,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:26,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:26,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:26,897 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2019-01-01 22:05:26,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:26,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:26,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:26,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:26,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:27,168 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 22:05:27,292 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-01 22:05:27,896 WARN L181 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-01-01 22:05:27,959 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:27,959 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:27,959 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:27,959 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:27,960 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:27,960 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:27,960 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:27,960 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:27,960 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca_false-termination.c.i_Iteration5_Lasso [2019-01-01 22:05:27,960 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:27,960 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:27,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:27,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:27,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:27,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:28,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:28,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:28,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:28,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:28,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:28,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:28,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:28,534 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:28,535 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:28,535 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 [2019-01-01 22:05:28,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:28,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:28,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:28,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:28,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:28,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:28,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:28,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:28,538 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 [2019-01-01 22:05:28,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:28,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:28,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:28,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:28,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:28,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:28,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:28,554 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 [2019-01-01 22:05:28,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:28,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:28,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:28,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:28,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:28,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:28,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:28,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:28,558 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 [2019-01-01 22:05:28,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:28,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:28,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:28,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:28,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:28,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:28,599 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:28,612 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:05:28,614 INFO L444 ModelExtractionUtils]: 22 out of 25 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:05:28,615 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:28,617 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:28,617 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:28,618 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-01-01 22:05:28,664 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 22:05:28,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:28,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:28,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:28,751 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 [2019-01-01 22:05:28,751 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 22:05:28,767 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 31 transitions. Complement of second has 5 states. [2019-01-01 22:05:28,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:05:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:05:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-01 22:05:28,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-01-01 22:05:28,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:28,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-01-01 22:05:28,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:28,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-01 22:05:28,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:28,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2019-01-01 22:05:28,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:05:28,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2019-01-01 22:05:28,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 22:05:28,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 22:05:28,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2019-01-01 22:05:28,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:28,774 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-01-01 22:05:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2019-01-01 22:05:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-01 22:05:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 22:05:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-01-01 22:05:28,777 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-01-01 22:05:28,777 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-01-01 22:05:28,777 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:05:28,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-01-01 22:05:28,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:05:28,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:28,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:28,779 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:28,779 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:05:28,779 INFO L794 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 488#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; 489#L367 assume !(main_~length~0 < 1); 500#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; 501#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 502#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); 506#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 503#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 504#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); 490#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 491#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 507#L370-3 assume !(main_~i~0 < main_~length~0); 492#L370-4 main_~j~0 := 0; 493#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); 499#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; 505#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); 508#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; 495#L378-2 [2019-01-01 22:05:28,779 INFO L796 eck$LassoCheckResult]: Loop: 495#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); 496#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; 495#L378-2 [2019-01-01 22:05:28,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:28,779 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2019-01-01 22:05:28,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:28,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:28,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:28,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:28,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:28,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:28,802 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-01-01 22:05:28,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:28,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:28,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:28,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:28,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:28,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:28,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2019-01-01 22:05:28,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:28,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:28,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:28,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:28,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:29,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:05:29,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:05:29,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 22:05:29,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-01 22:05:29,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:05:29,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:29,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:05:29,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-01-01 22:05:29,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 22:05:29,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-01 22:05:29,393 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 13 states. [2019-01-01 22:05:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:29,542 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-01-01 22:05:29,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 22:05:29,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-01-01 22:05:29,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 22:05:29,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 60 transitions. [2019-01-01 22:05:29,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-01 22:05:29,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-01 22:05:29,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2019-01-01 22:05:29,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:29,547 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2019-01-01 22:05:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2019-01-01 22:05:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-01-01 22:05:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 22:05:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2019-01-01 22:05:29,551 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-01-01 22:05:29,551 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-01-01 22:05:29,552 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:05:29,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2019-01-01 22:05:29,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:05:29,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:29,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:29,553 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:29,553 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-01-01 22:05:29,554 INFO L794 eck$LassoCheckResult]: Stem: 643#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 637#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; 638#L367 assume !(main_~length~0 < 1); 649#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; 650#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 651#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); 657#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 660#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 658#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); 659#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 652#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 653#L370-3 assume !(main_~i~0 < main_~length~0); 641#L370-4 main_~j~0 := 0; 642#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); 662#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; 661#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); 655#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; 656#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; 670#L378-2 [2019-01-01 22:05:29,554 INFO L796 eck$LassoCheckResult]: Loop: 670#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); 667#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; 644#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); 645#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; 670#L378-2 [2019-01-01 22:05:29,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:29,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2019-01-01 22:05:29,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:29,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:29,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:29,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:29,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:29,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:29,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-01-01 22:05:29,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:29,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:29,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:29,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:29,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:29,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:29,587 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2019-01-01 22:05:29,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:29,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:29,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:29,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:29,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:29,732 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-01-01 22:05:29,837 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 22:05:30,194 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 103 [2019-01-01 22:05:30,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:05:30 BoogieIcfgContainer [2019-01-01 22:05:30,319 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:05:30,319 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:05:30,319 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:05:30,320 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:05:30,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:21" (3/4) ... [2019-01-01 22:05:30,331 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 22:05:30,482 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 22:05:30,483 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:05:30,484 INFO L168 Benchmark]: Toolchain (without parser) took 10687.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 952.7 MB in the beginning and 881.2 MB in the end (delta: 71.5 MB). Peak memory consumption was 283.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:30,488 INFO L168 Benchmark]: CDTParser took 0.15 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. [2019-01-01 22:05:30,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:30,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.85 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:30,490 INFO L168 Benchmark]: Boogie Preprocessor took 42.44 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. [2019-01-01 22:05:30,494 INFO L168 Benchmark]: RCFGBuilder took 450.67 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.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:30,495 INFO L168 Benchmark]: BuchiAutomizer took 9183.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 881.2 MB in the end (delta: 209.5 MB). Peak memory consumption was 291.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:30,496 INFO L168 Benchmark]: Witness Printer took 163.31 ms. Allocated memory is still 1.2 GB. Free memory is still 881.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:30,507 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.15 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 777.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.85 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.44 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 450.67 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.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9183.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 881.2 MB in the end (delta: 209.5 MB). Peak memory consumption was 291.8 MB. Max. memory is 11.5 GB. * Witness Printer took 163.31 ms. Allocated memory is still 1.2 GB. Free memory is still 881.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.0s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 7.7s. Construction of modules took 0.4s. Büchi inclusion checks took 0.7s. 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: 66 SDtfs, 105 SDslu, 81 SDs, 0 SdLazy, 191 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital124 mio100 ax100 hnf98 lsp93 ukn82 mio100 lsp61 div100 bol100 ite100 ukn100 eq163 hnf88 smp95 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, \result=0, NULL=0, arr=-1, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1fcce373=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67f2d577=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25a4ed0d=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@5ed8d009=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25a4ed0d=-1, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@6d55bb20=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@6d917ebd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@4ba7145a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5043484c=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) [L381] j++ [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ Loop: [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...