./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2f8c9504db0ceae8da468539322e1d0ba6c4e9f7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:33:02,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:33:02,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:33:02,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:33:02,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:33:02,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:33:02,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:33:02,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:33:02,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:33:02,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:33:02,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:33:02,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:33:02,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:33:02,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:33:02,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:33:02,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:33:02,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:33:02,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:33:02,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:33:02,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:33:02,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:33:02,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:33:02,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:33:02,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:33:02,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:33:02,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:33:02,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:33:02,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:33:02,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:33:02,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:33:02,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:33:02,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:33:02,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:33:02,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:33:02,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:33:02,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:33:02,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:33:02,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:33:02,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:33:02,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:33:02,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:33:02,777 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:33:02,799 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:33:02,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:33:02,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:33:02,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:33:02,801 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:33:02,801 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:33:02,802 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:33:02,802 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:33:02,802 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:33:02,803 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:33:02,803 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:33:02,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:33:02,803 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:33:02,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:33:02,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:33:02,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:33:02,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:33:02,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:33:02,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:33:02,805 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:33:02,806 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:33:02,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:33:02,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:33:02,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:33:02,807 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:33:02,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:33:02,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:33:02,808 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:33:02,808 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:33:02,809 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:33:02,809 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f8c9504db0ceae8da468539322e1d0ba6c4e9f7 [2019-11-28 20:33:03,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:33:03,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:33:03,152 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:33:03,155 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:33:03,156 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:33:03,157 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2019-11-28 20:33:03,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b31fa341/ecbfd6c25bca45e2aa76c76db135fa19/FLAGc2fe405b0 [2019-11-28 20:33:03,783 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:33:03,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2019-11-28 20:33:03,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b31fa341/ecbfd6c25bca45e2aa76c76db135fa19/FLAGc2fe405b0 [2019-11-28 20:33:04,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b31fa341/ecbfd6c25bca45e2aa76c76db135fa19 [2019-11-28 20:33:04,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:33:04,086 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:33:04,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:33:04,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:33:04,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:33:04,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a3a9e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04, skipping insertion in model container [2019-11-28 20:33:04,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:33:04,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:33:04,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:33:04,598 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:33:04,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:33:04,701 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:33:04,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04 WrapperNode [2019-11-28 20:33:04,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:33:04,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:33:04,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:33:04,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:33:04,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:33:04,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:33:04,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:33:04,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:33:04,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:33:04,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:33:04,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:33:04,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:33:04,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:33:04,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:33:04,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:33:04,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:33:04,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:33:04,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:33:05,221 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:33:05,222 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:33:05,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:33:05 BoogieIcfgContainer [2019-11-28 20:33:05,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:33:05,224 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:33:05,224 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:33:05,231 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:33:05,232 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:33:05,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:33:04" (1/3) ... [2019-11-28 20:33:05,233 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1128b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:33:05, skipping insertion in model container [2019-11-28 20:33:05,233 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:33:05,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (2/3) ... [2019-11-28 20:33:05,234 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1128b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:33:05, skipping insertion in model container [2019-11-28 20:33:05,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:33:05,235 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:33:05" (3/3) ... [2019-11-28 20:33:05,236 INFO L371 chiAutomizerObserver]: Analyzing ICFG Velroyen-alloca.i [2019-11-28 20:33:05,284 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:33:05,284 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:33:05,284 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:33:05,285 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:33:05,285 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:33:05,285 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:33:05,286 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:33:05,286 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:33:05,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-28 20:33:05,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:33:05,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:05,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:05,327 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:33:05,327 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:33:05,327 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:33:05,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-28 20:33:05,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:33:05,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:05,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:05,330 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:33:05,330 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:33:05,336 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 14#L552-3true [2019-11-28 20:33:05,337 INFO L796 eck$LassoCheckResult]: Loop: 14#L552-3true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 11#L551-1true assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 8#L552true assume !main_#t~short7; 12#L552-2true assume !main_#t~short7;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 14#L552-3true [2019-11-28 20:33:05,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:05,342 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 20:33:05,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:05,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465301879] [2019-11-28 20:33:05,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:05,478 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:05,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:05,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1144151, now seen corresponding path program 1 times [2019-11-28 20:33:05,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:05,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169862263] [2019-11-28 20:33:05,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:05,503 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:05,506 INFO L82 PathProgramCache]: Analyzing trace with hash 889571353, now seen corresponding path program 1 times [2019-11-28 20:33:05,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:05,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013416976] [2019-11-28 20:33:05,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:05,548 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:05,707 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-11-28 20:33:05,889 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-28 20:33:05,948 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:33:05,949 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:33:05,949 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:33:05,949 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:33:05,950 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:33:05,950 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:05,950 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:33:05,950 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:33:05,950 INFO L133 ssoRankerPreferences]: Filename of dumped script: Velroyen-alloca.i_Iteration1_Lasso [2019-11-28 20:33:05,950 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:33:05,951 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:33:05,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:05,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:05,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:05,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-11-28 20:33:05,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:05,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:06,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:06,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:06,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:06,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:06,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:06,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:06,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:06,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:06,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:06,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:33:06,487 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:33:06,492 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:06,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:06,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:06,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:06,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:06,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:06,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:06,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:06,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:06,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:06,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:06,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:06,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:06,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:06,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:06,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:06,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:06,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:06,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:06,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:06,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:06,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:06,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:06,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:06,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:06,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:06,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:06,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:06,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:06,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:06,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:06,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:06,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:06,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:06,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:06,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:06,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:06,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:06,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:06,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:33:06,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:06,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:06,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:06,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:06,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:06,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:06,968 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:33:07,028 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-28 20:33:07,029 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:07,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:07,081 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:33:07,081 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:33:07,082 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2019-11-28 20:33:07,120 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 20:33:07,129 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:33:07,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:07,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:33:07,178 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:07,204 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:33:07,205 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:07,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:33:07,302 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:33:07,304 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2019-11-28 20:33:07,436 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 42 states and 56 transitions. Complement of second has 10 states. [2019-11-28 20:33:07,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:33:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:33:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-28 20:33:07,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-28 20:33:07,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:07,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 20:33:07,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:07,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-28 20:33:07,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:07,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2019-11-28 20:33:07,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:33:07,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 23 states and 35 transitions. [2019-11-28 20:33:07,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 20:33:07,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 20:33:07,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 35 transitions. [2019-11-28 20:33:07,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:33:07,457 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-11-28 20:33:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 35 transitions. [2019-11-28 20:33:07,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-11-28 20:33:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 20:33:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-28 20:33:07,491 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-28 20:33:07,491 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-28 20:33:07,491 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:33:07,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-11-28 20:33:07,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:33:07,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:07,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:07,494 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:33:07,494 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:33:07,495 INFO L794 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 116#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 117#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 129#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 130#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 125#L552-2 [2019-11-28 20:33:07,495 INFO L796 eck$LassoCheckResult]: Loop: 125#L552-2 assume !main_#t~short7;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 128#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 133#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 124#L552 assume !main_#t~short7; 125#L552-2 [2019-11-28 20:33:07,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:07,495 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-11-28 20:33:07,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:07,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111771396] [2019-11-28 20:33:07,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:07,541 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:07,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:07,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1943531, now seen corresponding path program 2 times [2019-11-28 20:33:07,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:07,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093008469] [2019-11-28 20:33:07,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:33:07,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093008469] [2019-11-28 20:33:07,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:33:07,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:33:07,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104776480] [2019-11-28 20:33:07,643 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:33:07,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:33:07,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:33:07,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:33:07,649 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 20:33:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:33:07,698 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-11-28 20:33:07,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:33:07,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2019-11-28 20:33:07,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:33:07,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 27 transitions. [2019-11-28 20:33:07,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 20:33:07,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 20:33:07,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-28 20:33:07,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:33:07,707 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-28 20:33:07,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-28 20:33:07,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 20:33:07,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 20:33:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-11-28 20:33:07,711 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-28 20:33:07,711 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-28 20:33:07,713 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:33:07,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-11-28 20:33:07,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:33:07,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:07,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:07,718 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:33:07,719 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:33:07,719 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 170#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 171#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 184#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 178#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 180#L552-2 [2019-11-28 20:33:07,719 INFO L796 eck$LassoCheckResult]: Loop: 180#L552-2 assume main_#t~short7;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 187#L553 assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); 183#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 186#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 189#L552 assume !main_#t~short7; 180#L552-2 [2019-11-28 20:33:07,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 2 times [2019-11-28 20:33:07,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:07,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345308469] [2019-11-28 20:33:07,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:07,778 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:07,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash 48745192, now seen corresponding path program 1 times [2019-11-28 20:33:07,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:07,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397860609] [2019-11-28 20:33:07,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:33:07,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397860609] [2019-11-28 20:33:07,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:33:07,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:33:07,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160277271] [2019-11-28 20:33:07,838 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:33:07,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:33:07,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:33:07,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:33:07,840 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 20:33:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:33:07,911 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-11-28 20:33:07,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:33:07,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-28 20:33:07,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 20:33:07,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 38 transitions. [2019-11-28 20:33:07,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 20:33:07,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-28 20:33:07,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-11-28 20:33:07,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:33:07,916 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-11-28 20:33:07,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-11-28 20:33:07,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-11-28 20:33:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 20:33:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-11-28 20:33:07,920 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-28 20:33:07,920 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-28 20:33:07,920 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:33:07,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-11-28 20:33:07,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 20:33:07,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:07,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:07,922 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:33:07,922 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:33:07,923 INFO L794 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 230#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 231#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 247#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 249#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 239#L552-2 [2019-11-28 20:33:07,923 INFO L796 eck$LassoCheckResult]: Loop: 239#L552-2 assume main_#t~short7;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 252#L553 assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); 235#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 244#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 238#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 239#L552-2 [2019-11-28 20:33:07,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:07,923 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 3 times [2019-11-28 20:33:07,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:07,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686126321] [2019-11-28 20:33:07,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:07,947 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:07,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:07,948 INFO L82 PathProgramCache]: Analyzing trace with hash 48745190, now seen corresponding path program 1 times [2019-11-28 20:33:07,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:07,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641143444] [2019-11-28 20:33:07,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:07,965 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:07,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:07,966 INFO L82 PathProgramCache]: Analyzing trace with hash 707540352, now seen corresponding path program 1 times [2019-11-28 20:33:07,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:07,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046895667] [2019-11-28 20:33:07,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 20:33:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:08,047 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:08,362 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-11-28 20:33:08,651 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-11-28 20:33:08,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:33:08 BoogieIcfgContainer [2019-11-28 20:33:08,683 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:33:08,684 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:33:08,684 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:33:08,684 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:33:08,685 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:33:05" (3/4) ... [2019-11-28 20:33:08,689 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 20:33:08,736 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:33:08,736 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:33:08,738 INFO L168 Benchmark]: Toolchain (without parser) took 4651.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 64.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:08,739 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:33:08,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:08,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.04 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-11-28 20:33:08,741 INFO L168 Benchmark]: Boogie Preprocessor took 25.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:08,742 INFO L168 Benchmark]: RCFGBuilder took 443.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:08,742 INFO L168 Benchmark]: BuchiAutomizer took 3459.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.1 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:08,743 INFO L168 Benchmark]: Witness Printer took 52.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:33:08,747 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 614.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.04 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. * Boogie Preprocessor took 25.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 443.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3459.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.1 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. * Witness Printer took 52.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. 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 #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 16 SDslu, 27 SDs, 0 SdLazy, 75 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax118 hnf100 lsp76 ukn72 mio100 lsp41 div100 bol100 ite100 ukn100 eq144 hnf92 smp83 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 552]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@152e2514=2, NULL=0, \result=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68f8329b=0, NULL=0, x=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@152e2514=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@4ba555f3=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@56c3869=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@5608bce3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@4a24667d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@529a80f9=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@7e03adaf=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@1b9ff7b1=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 552]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 Loop: [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...