./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/aaron3_true-termination_true-valid-memsafety.c --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-crafted/aaron3_true-termination_true-valid-memsafety.c -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 b11f086006b59545dfe302b4d0afe0208312f571 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:33:10,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:33:10,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:33:10,195 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:33:10,195 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:33:10,196 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:33:10,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:33:10,200 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:33:10,202 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:33:10,203 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:33:10,204 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:33:10,204 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:33:10,208 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:33:10,209 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:33:10,210 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:33:10,213 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:33:10,214 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:33:10,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:33:10,219 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:33:10,221 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:33:10,222 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:33:10,223 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:33:10,226 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:33:10,226 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:33:10,226 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:33:10,227 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:33:10,228 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:33:10,229 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:33:10,230 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:33:10,231 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:33:10,232 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:33:10,232 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:33:10,233 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:33:10,233 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:33:10,234 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:33:10,235 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:33:10,235 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:33:10,265 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:33:10,266 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:33:10,267 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:33:10,268 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:33:10,268 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:33:10,268 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:33:10,268 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:33:10,268 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:33:10,269 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:33:10,269 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:33:10,269 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:33:10,269 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:33:10,269 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:33:10,272 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:33:10,272 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:33:10,273 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:33:10,273 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:33:10,273 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:33:10,273 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:33:10,273 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:33:10,273 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:33:10,274 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:33:10,274 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:33:10,274 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:33:10,274 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:33:10,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:33:10,275 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:33:10,278 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:33:10,280 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:33:10,280 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 -> b11f086006b59545dfe302b4d0afe0208312f571 [2019-01-01 21:33:10,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:33:10,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:33:10,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:33:10,352 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:33:10,352 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:33:10,354 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/aaron3_true-termination_true-valid-memsafety.c [2019-01-01 21:33:10,424 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13134bfe/4bf230782a2c4fae9a804658924eb726/FLAGf82e7b052 [2019-01-01 21:33:10,897 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:33:10,898 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/aaron3_true-termination_true-valid-memsafety.c [2019-01-01 21:33:10,908 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13134bfe/4bf230782a2c4fae9a804658924eb726/FLAGf82e7b052 [2019-01-01 21:33:11,228 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13134bfe/4bf230782a2c4fae9a804658924eb726 [2019-01-01 21:33:11,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:33:11,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:33:11,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:11,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:33:11,244 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:33:11,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:11" (1/1) ... [2019-01-01 21:33:11,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55426fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:11, skipping insertion in model container [2019-01-01 21:33:11,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:11" (1/1) ... [2019-01-01 21:33:11,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:33:11,281 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:33:11,542 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:11,547 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:33:11,568 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:11,582 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:33:11,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:11 WrapperNode [2019-01-01 21:33:11,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:11,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:11,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:33:11,585 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:33:11,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:11" (1/1) ... [2019-01-01 21:33:11,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:11" (1/1) ... [2019-01-01 21:33:11,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:11,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:33:11,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:33:11,632 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:33:11,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:11" (1/1) ... [2019-01-01 21:33:11,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:11" (1/1) ... [2019-01-01 21:33:11,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:11" (1/1) ... [2019-01-01 21:33:11,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:11" (1/1) ... [2019-01-01 21:33:11,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:11" (1/1) ... [2019-01-01 21:33:11,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:11" (1/1) ... [2019-01-01 21:33:11,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:11" (1/1) ... [2019-01-01 21:33:11,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:33:11,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:33:11,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:33:11,661 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:33:11,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:11" (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 21:33:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:33:11,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:33:12,099 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:33:12,100 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:33:12,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:12 BoogieIcfgContainer [2019-01-01 21:33:12,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:33:12,101 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:33:12,102 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:33:12,107 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:33:12,108 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:12,108 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:33:11" (1/3) ... [2019-01-01 21:33:12,110 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23cef4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:12, skipping insertion in model container [2019-01-01 21:33:12,110 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:12,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:11" (2/3) ... [2019-01-01 21:33:12,111 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23cef4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:12, skipping insertion in model container [2019-01-01 21:33:12,111 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:12,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:12" (3/3) ... [2019-01-01 21:33:12,114 INFO L375 chiAutomizerObserver]: Analyzing ICFG aaron3_true-termination_true-valid-memsafety.c [2019-01-01 21:33:12,200 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:33:12,201 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:33:12,201 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:33:12,201 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:33:12,201 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:33:12,201 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:33:12,201 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:33:12,202 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:33:12,202 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:33:12,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:33:12,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:12,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:12,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:12,251 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:33:12,251 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:12,252 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:33:12,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:33:12,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:12,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:12,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:12,259 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:33:12,259 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:12,274 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~z~0, main_~tx~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;havoc main_~tx~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~tx~0 := main_#t~nondet3;havoc main_#t~nondet3; 6#L22true assume !!(-1073741823 <= main_~tx~0 && main_~tx~0 <= 1073741823); 7#L23true assume !!(-1073741823 <= main_~z~0 && main_~z~0 <= 1073741823); 9#L24true assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); 12#L25true assume !!(main_~y~0 <= 1073741823); 13#L27-2true [2019-01-01 21:33:12,278 INFO L796 eck$LassoCheckResult]: Loop: 13#L27-2true assume !!(main_~x~0 >= main_~y~0 && main_~x~0 <= main_~tx~0 + main_~z~0); 5#L27true assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;main_~y~0 := 1 + main_~y~0; 13#L27-2true [2019-01-01 21:33:12,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:12,288 INFO L82 PathProgramCache]: Analyzing trace with hash 29742506, now seen corresponding path program 1 times [2019-01-01 21:33:12,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:12,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:12,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:12,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:12,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:12,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1931, now seen corresponding path program 1 times [2019-01-01 21:33:12,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:12,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:12,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:12,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:12,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:12,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:12,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1482221836, now seen corresponding path program 1 times [2019-01-01 21:33:12,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:12,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:12,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:12,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:12,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:12,586 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:12,587 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:12,588 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:12,588 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:12,588 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:12,588 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:12,588 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:12,588 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:12,589 INFO L131 ssoRankerPreferences]: Filename of dumped script: aaron3_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:33:12,589 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:12,589 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:12,616 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 21:33:12,642 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 21:33:12,662 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 21:33:12,682 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 21:33:12,972 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:12,973 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:12,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:12,990 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:13,047 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:13,048 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2019-01-01 21:33:13,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:13,059 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:13,115 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:13,115 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 21:33:13,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:13,125 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 21:33:13,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:13,152 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:13,404 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:13,407 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:13,407 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:13,407 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:13,407 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:13,407 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:13,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:13,408 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:13,408 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:13,408 INFO L131 ssoRankerPreferences]: Filename of dumped script: aaron3_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:33:13,408 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:13,408 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:13,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 21:33:13,416 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 21:33:13,429 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 21:33:13,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:13,612 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:13,618 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:13,621 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 21:33:13,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:13,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:13,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:13,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:13,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:13,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:13,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:13,638 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 21:33:13,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:13,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:13,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:13,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:13,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:13,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:13,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:13,653 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 21:33:13,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:13,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:13,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:13,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:13,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:13,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:13,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:13,664 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:13,676 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:13,677 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:33:13,679 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:13,679 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:13,679 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:13,680 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~x~0 - 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2019-01-01 21:33:13,682 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:13,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:13,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:13,975 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 21:33:13,992 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 21:33:13,993 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 3 states. [2019-01-01 21:33:14,059 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 3 states. Result 31 states and 42 transitions. Complement of second has 8 states. [2019-01-01 21:33:14,060 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 21:33:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:14,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-01-01 21:33:14,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:33:14,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:14,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:33:14,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:14,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:33:14,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:14,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2019-01-01 21:33:14,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:14,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 12 states and 15 transitions. [2019-01-01 21:33:14,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:33:14,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:33:14,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2019-01-01 21:33:14,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:14,079 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-01 21:33:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2019-01-01 21:33:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-01 21:33:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:33:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-01-01 21:33:14,107 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-01 21:33:14,107 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-01 21:33:14,107 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:33:14,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-01-01 21:33:14,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:14,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:14,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:14,110 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:33:14,110 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:33:14,110 INFO L794 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~z~0, main_~tx~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;havoc main_~tx~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~tx~0 := main_#t~nondet3;havoc main_#t~nondet3; 95#L22 assume !!(-1073741823 <= main_~tx~0 && main_~tx~0 <= 1073741823); 99#L23 assume !!(-1073741823 <= main_~z~0 && main_~z~0 <= 1073741823); 100#L24 assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); 101#L25 assume !!(main_~y~0 <= 1073741823); 103#L27-2 assume !!(main_~x~0 >= main_~y~0 && main_~x~0 <= main_~tx~0 + main_~z~0); 96#L27 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~z~0 := main_~z~0 - 1;main_~tx~0 := main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 92#L31 [2019-01-01 21:33:14,110 INFO L796 eck$LassoCheckResult]: Loop: 92#L31 assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); 93#L27-2 assume !!(main_~x~0 >= main_~y~0 && main_~x~0 <= main_~tx~0 + main_~z~0); 102#L27 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~z~0 := main_~z~0 - 1;main_~tx~0 := main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 92#L31 [2019-01-01 21:33:14,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:14,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1482221843, now seen corresponding path program 1 times [2019-01-01 21:33:14,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:14,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:14,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:14,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:14,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:14,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:14,133 INFO L82 PathProgramCache]: Analyzing trace with hash 67272, now seen corresponding path program 1 times [2019-01-01 21:33:14,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:14,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:14,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:14,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:14,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:14,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:14,157 INFO L82 PathProgramCache]: Analyzing trace with hash -312117156, now seen corresponding path program 1 times [2019-01-01 21:33:14,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:14,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:14,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:14,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:14,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:14,268 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:14,268 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:14,268 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:14,268 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:14,269 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:14,269 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:14,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:14,269 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:14,269 INFO L131 ssoRankerPreferences]: Filename of dumped script: aaron3_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:33:14,269 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:14,269 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:14,272 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 21:33:14,278 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 21:33:14,283 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 21:33:14,292 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 21:33:14,652 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 21:33:14,937 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:14,937 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01-01 21:33:14,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:14,943 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:14,965 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:14,966 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:14,971 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:14,971 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:14,978 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:14,978 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:15,002 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:15,002 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:15,029 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:15,029 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:15,035 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:15,035 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:15,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:15,071 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:34,012 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 21:33:34,018 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:34,019 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:34,019 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:34,019 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:34,019 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:34,019 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:34,019 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:34,020 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:34,020 INFO L131 ssoRankerPreferences]: Filename of dumped script: aaron3_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:33:34,020 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:34,020 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:34,022 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 21:33:34,030 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 21:33:34,036 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 21:33:34,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-01-01 21:33:34,492 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:34,492 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:34,494 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 21:33:34,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:34,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:34,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:34,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:34,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:34,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:34,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:34,504 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 21:33:34,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:34,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:34,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:34,507 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:33:34,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:34,508 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:33:34,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:34,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:34,514 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 21:33:34,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:34,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:34,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:34,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:34,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:34,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:34,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:34,530 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 21:33:34,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:34,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:34,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:34,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:34,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:34,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:34,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:34,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:34,553 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 21:33:34,553 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 21:33:34,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:34,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:34,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:34,556 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:33:34,559 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:33:34,560 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:33:34,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:34,564 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 21:33:34,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:34,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:34,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:34,566 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:33:34,567 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:33:34,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:34,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:34,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:34,575 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 21:33:34,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:34,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:34,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:34,576 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:33:34,580 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:33:34,581 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:33:34,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:34,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 21:33:34,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:34,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:34,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:34,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:34,594 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:33:34,600 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:33:34,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:34,621 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:34,634 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:33:34,634 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:34,635 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:34,635 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:34,635 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:34,635 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 2*ULTIMATE.start_main_~z~0 f1 = 2*ULTIMATE.start_main_~tx~0 + 2*ULTIMATE.start_main_~z~0 + 2147483647 Supporting invariants [] [2019-01-01 21:33:34,636 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:34,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:34,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:34,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:35,140 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-01-01 21:33:35,142 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 21:33:35,142 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-01-01 21:33:35,142 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 21:33:35,417 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-01-01 21:33:35,431 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 17 states and 22 transitions. Complement of second has 6 states. [2019-01-01 21:33:35,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-01 21:33:35,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:33:35,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:35,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 21:33:35,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:35,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-01 21:33:35,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:35,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-01-01 21:33:35,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:35,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2019-01-01 21:33:35,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:33:35,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:33:35,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-01-01 21:33:35,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:35,438 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-01 21:33:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-01-01 21:33:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-01-01 21:33:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:33:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-01-01 21:33:35,441 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-01 21:33:35,441 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-01 21:33:35,441 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:33:35,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-01-01 21:33:35,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:35,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:35,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:35,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:33:35,443 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:35,443 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~z~0, main_~tx~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;havoc main_~tx~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~tx~0 := main_#t~nondet3;havoc main_#t~nondet3; 184#L22 assume !!(-1073741823 <= main_~tx~0 && main_~tx~0 <= 1073741823); 188#L23 assume !!(-1073741823 <= main_~z~0 && main_~z~0 <= 1073741823); 189#L24 assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); 190#L25 assume !!(main_~y~0 <= 1073741823); 192#L27-2 assume !!(main_~x~0 >= main_~y~0 && main_~x~0 <= main_~tx~0 + main_~z~0); 193#L27 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~z~0 := main_~z~0 - 1;main_~tx~0 := main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 179#L31 assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); 181#L27-2 [2019-01-01 21:33:35,443 INFO L796 eck$LassoCheckResult]: Loop: 181#L27-2 assume !!(main_~x~0 >= main_~y~0 && main_~x~0 <= main_~tx~0 + main_~z~0); 185#L27 assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;main_~y~0 := 1 + main_~y~0; 181#L27-2 [2019-01-01 21:33:35,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:35,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1295763161, now seen corresponding path program 2 times [2019-01-01 21:33:35,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:35,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:35,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:35,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:35,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:35,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:35,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1931, now seen corresponding path program 2 times [2019-01-01 21:33:35,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:35,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:35,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:35,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:35,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:35,467 INFO L82 PathProgramCache]: Analyzing trace with hash -312117149, now seen corresponding path program 1 times [2019-01-01 21:33:35,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:35,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:35,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:35,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:35,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:35,542 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:35,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:35,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:35,542 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:35,543 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:35,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:35,543 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:35,543 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:35,543 INFO L131 ssoRankerPreferences]: Filename of dumped script: aaron3_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:33:35,543 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:35,543 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:35,546 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 21:33:35,585 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 21:33:35,597 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 21:33:35,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:35,684 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:35,684 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:35,688 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:35,688 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:35,692 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:35,692 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:35,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:35,716 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:35,738 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:35,738 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:35,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:35,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:35,764 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:35,765 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 21:33:35,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:35,769 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 21:33:35,798 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:35,798 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:36,034 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:36,036 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:36,037 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:36,037 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:36,037 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:36,037 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:36,037 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:36,037 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:36,037 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:36,037 INFO L131 ssoRankerPreferences]: Filename of dumped script: aaron3_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:33:36,037 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:36,038 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:36,043 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 21:33:36,054 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 21:33:36,057 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 21:33:36,066 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 21:33:36,127 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:36,128 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:36,128 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 21:33:36,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:36,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:36,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:36,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:36,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:36,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:36,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:36,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:36,133 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 21:33:36,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:36,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:36,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:36,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:36,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:36,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:36,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:36,141 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 21:33:36,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:36,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:36,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:36,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:36,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:36,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:36,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:36,149 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:36,153 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:36,153 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:33:36,153 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:36,154 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:36,154 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:36,154 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] [2019-01-01 21:33:36,154 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:36,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:36,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:36,234 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 21:33:36,234 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 21:33:36,234 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:33:36,251 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 22 states and 29 transitions. Complement of second has 5 states. [2019-01-01 21:33:36,253 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 21:33:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-01 21:33:36,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 21:33:36,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:36,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-01 21:33:36,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:36,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-01 21:33:36,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:36,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2019-01-01 21:33:36,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:36,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 18 states and 23 transitions. [2019-01-01 21:33:36,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:33:36,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:33:36,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-01-01 21:33:36,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:36,259 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-01 21:33:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-01-01 21:33:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-01 21:33:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 21:33:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-01-01 21:33:36,262 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-01 21:33:36,262 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-01 21:33:36,262 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:33:36,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-01-01 21:33:36,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:36,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:36,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:36,265 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 21:33:36,265 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:36,265 INFO L794 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~z~0, main_~tx~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;havoc main_~tx~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~tx~0 := main_#t~nondet3;havoc main_#t~nondet3; 273#L22 assume !!(-1073741823 <= main_~tx~0 && main_~tx~0 <= 1073741823); 276#L23 assume !!(-1073741823 <= main_~z~0 && main_~z~0 <= 1073741823); 277#L24 assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); 278#L25 assume !!(main_~y~0 <= 1073741823); 280#L27-2 assume !!(main_~x~0 >= main_~y~0 && main_~x~0 <= main_~tx~0 + main_~z~0); 281#L27 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~z~0 := main_~z~0 - 1;main_~tx~0 := main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 267#L31 assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); 268#L27-2 assume !!(main_~x~0 >= main_~y~0 && main_~x~0 <= main_~tx~0 + main_~z~0); 282#L27 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~z~0 := main_~z~0 - 1;main_~tx~0 := main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 269#L31 assume !!(-1073741823 <= main_~x~0 && main_~x~0 <= 1073741823); 271#L27-2 [2019-01-01 21:33:36,267 INFO L796 eck$LassoCheckResult]: Loop: 271#L27-2 assume !!(main_~x~0 >= main_~y~0 && main_~x~0 <= main_~tx~0 + main_~z~0); 274#L27 assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;main_~y~0 := 1 + main_~y~0; 271#L27-2 [2019-01-01 21:33:36,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1085697206, now seen corresponding path program 3 times [2019-01-01 21:33:36,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:36,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:36,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:36,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:36,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:36,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:36,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1931, now seen corresponding path program 3 times [2019-01-01 21:33:36,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:36,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:36,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:36,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:36,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:36,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:36,295 INFO L82 PathProgramCache]: Analyzing trace with hash 322038932, now seen corresponding path program 2 times [2019-01-01 21:33:36,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:36,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:36,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:36,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:36,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:36,445 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:33:36,484 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:36,484 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:36,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:36,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:36,485 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:36,485 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:36,485 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:36,485 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:36,485 INFO L131 ssoRankerPreferences]: Filename of dumped script: aaron3_true-termination_true-valid-memsafety.c_Iteration4_Loop [2019-01-01 21:33:36,485 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:36,485 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:36,487 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 21:33:36,495 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 21:33:36,499 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 21:33:36,502 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 21:33:36,585 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:36,585 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01-01 21:33:36,590 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:36,590 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 21:33:36,638 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:36,639 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:36,940 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:36,942 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:36,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:36,942 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:36,942 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:36,942 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:36,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:36,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:36,943 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:36,943 INFO L131 ssoRankerPreferences]: Filename of dumped script: aaron3_true-termination_true-valid-memsafety.c_Iteration4_Loop [2019-01-01 21:33:36,943 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:36,943 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:36,945 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 21:33:36,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 21:33:36,967 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 21:33:36,970 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 21:33:37,036 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:37,037 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:37,038 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 21:33:37,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:37,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:37,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:37,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:37,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:37,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:37,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:37,042 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:37,045 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:37,045 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:33:37,046 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:37,046 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:37,046 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:37,046 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] [2019-01-01 21:33:37,046 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:37,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:37,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:37,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:37,204 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 21:33:37,204 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 21:33:37,206 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 21:33:37,236 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 5 states. [2019-01-01 21:33:37,238 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 21:33:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:37,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-01 21:33:37,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:33:37,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:37,239 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:37,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:37,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:37,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:37,297 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 21:33:37,298 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:33:37,299 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 21:33:37,315 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 5 states. [2019-01-01 21:33:37,318 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 21:33:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-01 21:33:37,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:33:37,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:37,320 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:37,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:37,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:37,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:37,374 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 21:33:37,375 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:33:37,375 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 21:33:37,407 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 29 transitions. Complement of second has 4 states. [2019-01-01 21:33:37,408 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 21:33:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:37,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-01 21:33:37,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:33:37,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:37,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-01 21:33:37,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:37,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-01 21:33:37,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:37,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2019-01-01 21:33:37,414 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:37,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2019-01-01 21:33:37,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:33:37,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:33:37,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:33:37,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:37,414 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:37,416 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:37,416 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:37,416 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:33:37,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:33:37,418 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:37,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:33:37,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:33:37 BoogieIcfgContainer [2019-01-01 21:33:37,426 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:33:37,427 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:33:37,427 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:33:37,427 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:33:37,429 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:12" (3/4) ... [2019-01-01 21:33:37,434 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:33:37,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:33:37,436 INFO L168 Benchmark]: Toolchain (without parser) took 26201.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -206.7 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:37,437 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:37,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.52 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:37,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.03 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:37,440 INFO L168 Benchmark]: Boogie Preprocessor took 28.15 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:37,440 INFO L168 Benchmark]: RCFGBuilder took 440.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:37,442 INFO L168 Benchmark]: BuchiAutomizer took 25325.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -34.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:37,443 INFO L168 Benchmark]: Witness Printer took 7.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:37,449 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.52 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.03 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.15 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 440.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25325.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -34.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Witness Printer took 7.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * x + -2 * y + 1 and consists of 5 locations. One deterministic module has 2-nested ranking function (if 2 * z > 0 then 1 else 0), (if 2 * z > 0 then 2 * z else 2 * tx + 2 * z + 2147483647) and consists of 4 locations. One deterministic module has affine ranking function -2 * y + 2 * x + 1 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * y + 2 * x + 1 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.2s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 23.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 60 SDtfs, 60 SDslu, 8 SDs, 0 SdLazy, 39 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax159 hnf100 lsp53 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq142 hnf94 smp100 dnf100 smp100 tf108 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 9 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 20.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...