./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 653582a7b000e4f324410c98077c6ee21baa5247 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:20:59,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:20:59,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:21:00,008 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:21:00,009 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:21:00,011 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:21:00,015 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:21:00,018 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:21:00,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:21:00,023 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:21:00,026 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:21:00,027 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:21:00,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:21:00,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:21:00,037 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:21:00,041 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:21:00,042 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:21:00,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:21:00,053 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:21:00,054 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:21:00,058 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:21:00,059 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:21:00,064 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:21:00,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:21:00,066 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:21:00,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:21:00,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:21:00,072 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:21:00,073 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:21:00,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:21:00,076 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:21:00,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:21:00,079 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:21:00,080 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:21:00,081 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:21:00,081 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:21:00,082 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:21:00,116 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:21:00,116 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:21:00,117 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:21:00,121 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:21:00,121 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:21:00,121 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:21:00,121 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:21:00,122 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:21:00,122 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:21:00,122 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:21:00,122 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:21:00,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:21:00,122 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:21:00,123 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:21:00,123 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:21:00,123 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:21:00,123 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:21:00,123 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:21:00,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:21:00,123 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:21:00,125 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:21:00,126 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:21:00,126 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:21:00,126 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:21:00,126 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:21:00,126 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:21:00,127 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:21:00,127 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:21:00,127 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:21:00,127 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:21:00,127 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:21:00,128 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:21:00,128 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 653582a7b000e4f324410c98077c6ee21baa5247 [2019-01-02 00:21:00,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:21:00,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:21:00,196 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:21:00,198 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:21:00,198 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:21:00,199 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:21:00,266 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b7a3794/08501e80f143450a813f88bac8aa4fb8/FLAG514e0b977 [2019-01-02 00:21:00,792 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:21:00,792 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:21:00,806 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b7a3794/08501e80f143450a813f88bac8aa4fb8/FLAG514e0b977 [2019-01-02 00:21:01,061 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b7a3794/08501e80f143450a813f88bac8aa4fb8 [2019-01-02 00:21:01,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:21:01,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:21:01,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:21:01,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:21:01,074 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:21:01,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:21:01" (1/1) ... [2019-01-02 00:21:01,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420f99b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:01, skipping insertion in model container [2019-01-02 00:21:01,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:21:01" (1/1) ... [2019-01-02 00:21:01,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:21:01,149 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:21:01,533 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:21:01,548 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:21:01,596 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:21:01,733 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:21:01,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:01 WrapperNode [2019-01-02 00:21:01,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:21:01,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:21:01,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:21:01,735 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:21:01,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:01" (1/1) ... [2019-01-02 00:21:01,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:01" (1/1) ... [2019-01-02 00:21:01,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:21:01,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:21:01,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:21:01,800 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:21:01,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:01" (1/1) ... [2019-01-02 00:21:01,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:01" (1/1) ... [2019-01-02 00:21:01,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:01" (1/1) ... [2019-01-02 00:21:01,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:01" (1/1) ... [2019-01-02 00:21:01,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:01" (1/1) ... [2019-01-02 00:21:01,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:01" (1/1) ... [2019-01-02 00:21:01,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:01" (1/1) ... [2019-01-02 00:21:01,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:21:01,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:21:01,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:21:01,832 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:21:01,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:01" (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-02 00:21:01,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:21:01,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:21:01,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:21:01,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:21:01,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:21:01,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:21:02,261 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:21:02,261 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-02 00:21:02,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:21:02 BoogieIcfgContainer [2019-01-02 00:21:02,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:21:02,263 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:21:02,263 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:21:02,267 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:21:02,268 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:21:02,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:21:01" (1/3) ... [2019-01-02 00:21:02,269 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fa275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:21:02, skipping insertion in model container [2019-01-02 00:21:02,270 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:21:02,270 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:01" (2/3) ... [2019-01-02 00:21:02,270 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fa275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:21:02, skipping insertion in model container [2019-01-02 00:21:02,270 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:21:02,271 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:21:02" (3/3) ... [2019-01-02 00:21:02,272 INFO L375 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:21:02,333 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:21:02,334 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:21:02,334 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:21:02,334 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:21:02,335 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:21:02,335 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:21:02,335 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:21:02,335 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:21:02,335 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:21:02,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-02 00:21:02,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:21:02,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:02,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:02,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:21:02,383 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:21:02,383 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:21:02,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-02 00:21:02,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:21:02,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:02,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:02,385 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:21:02,386 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:21:02,394 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 4#L557true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 6#L557-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 10#L545-3true [2019-01-02 00:21:02,394 INFO L796 eck$LassoCheckResult]: Loop: 10#L545-3true assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 5#L548-3true assume !true; 7#L545-2true sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 10#L545-3true [2019-01-02 00:21:02,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:02,401 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-02 00:21:02,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:02,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:02,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:02,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:02,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:02,546 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2019-01-02 00:21:02,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:02,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:02,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:02,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:02,577 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-02 00:21:02,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:21:02,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:21:02,583 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:21:02,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-02 00:21:02,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-02 00:21:02,601 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-01-02 00:21:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:21:02,609 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-02 00:21:02,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:21:02,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-01-02 00:21:02,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:21:02,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2019-01-02 00:21:02,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-02 00:21:02,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-02 00:21:02,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-01-02 00:21:02,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:21:02,620 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-02 00:21:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-01-02 00:21:02,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-02 00:21:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-02 00:21:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-02 00:21:02,651 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-02 00:21:02,651 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-02 00:21:02,651 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:21:02,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-02 00:21:02,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:21:02,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:02,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:02,653 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:21:02,653 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:21:02,653 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 41#L557-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 36#L545-3 [2019-01-02 00:21:02,654 INFO L796 eck$LassoCheckResult]: Loop: 36#L545-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 37#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 39#L548-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 40#L545-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 36#L545-3 [2019-01-02 00:21:02,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:02,654 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-02 00:21:02,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:02,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:02,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:02,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:02,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:02,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2019-01-02 00:21:02,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:02,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:02,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:02,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:02,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:02,698 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2019-01-02 00:21:02,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:02,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:02,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:02,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:02,858 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-02 00:21:03,264 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-02 00:21:03,368 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-02 00:21:03,395 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:21:03,397 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:21:03,397 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:21:03,397 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:21:03,397 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:21:03,398 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:21:03,398 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:21:03,398 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:21:03,398 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-02 00:21:03,398 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:21:03,399 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:21:03,423 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-02 00:21:03,603 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-02 00:21:03,635 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-02 00:21:03,639 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-02 00:21:03,641 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-02 00:21:03,673 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-02 00:21:03,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:03,693 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-02 00:21:03,697 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-02 00:21:03,706 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-02 00:21:03,709 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-02 00:21:03,713 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-02 00:21:03,717 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-02 00:21:03,720 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-02 00:21:04,169 WARN L181 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-02 00:21:04,574 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-02 00:21:04,636 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:21:04,642 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:21:04,645 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-02 00:21:04,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:04,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:04,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:04,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:04,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:04,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:04,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:04,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:04,654 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-02 00:21:04,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:04,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:04,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:04,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:04,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:04,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:04,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:04,666 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-02 00:21:04,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:04,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:04,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:04,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:04,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:04,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:04,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:04,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:04,671 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-02 00:21:04,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:04,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:04,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:04,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:04,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:04,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:04,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:04,681 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-02 00:21:04,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:04,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:04,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:04,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:04,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:04,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:04,778 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:21:04,837 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:21:04,837 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:21:04,842 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:21:04,844 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:21:04,844 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:21:04,849 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2019-01-02 00:21:04,860 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-02 00:21:04,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:04,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:04,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:04,971 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-02 00:21:04,976 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-02 00:21:04,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-02 00:21:05,014 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2019-01-02 00:21:05,016 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-02 00:21:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:21:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-02 00:21:05,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-02 00:21:05,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:05,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-02 00:21:05,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:05,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-02 00:21:05,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:05,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2019-01-02 00:21:05,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:21:05,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2019-01-02 00:21:05,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-02 00:21:05,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-02 00:21:05,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-02 00:21:05,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:21:05,025 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-02 00:21:05,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-02 00:21:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-02 00:21:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-02 00:21:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-01-02 00:21:05,027 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-02 00:21:05,027 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-02 00:21:05,027 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:21:05,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-01-02 00:21:05,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:21:05,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:05,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:05,030 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:21:05,030 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:21:05,030 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 103#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 104#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 113#L557-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 105#L545-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 107#L548-3 [2019-01-02 00:21:05,030 INFO L796 eck$LassoCheckResult]: Loop: 107#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 109#L548-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 107#L548-3 [2019-01-02 00:21:05,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:05,031 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-02 00:21:05,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:05,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:05,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:05,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:05,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:05,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:05,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2019-01-02 00:21:05,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:05,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:05,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:05,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:05,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-01-02 00:21:05,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:05,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:05,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:05,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:05,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:05,473 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-01-02 00:21:05,563 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:21:05,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:21:05,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:21:05,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:21:05,564 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:21:05,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:21:05,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:21:05,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:21:05,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-02 00:21:05,566 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:21:05,566 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:21:05,570 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-02 00:21:05,579 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-02 00:21:05,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:05,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:05,607 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-02 00:21:05,610 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-02 00:21:05,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:05,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-02 00:21:05,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:05,635 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-02 00:21:05,796 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-02 00:21:05,815 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-02 00:21:05,820 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-02 00:21:05,823 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-02 00:21:06,227 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:21:06,227 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:21:06,228 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-02 00:21:06,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:06,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:06,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:06,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:06,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:06,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:06,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:06,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:06,231 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-02 00:21:06,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:06,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:06,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:06,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:06,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:06,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:06,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:06,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:06,234 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-02 00:21:06,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:06,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:06,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:06,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:06,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:06,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:06,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:06,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:06,236 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-02 00:21:06,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:06,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:06,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:06,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:06,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:06,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:06,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:06,242 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-02 00:21:06,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:06,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:06,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:06,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:06,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:06,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:06,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:06,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:06,244 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-02 00:21:06,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:06,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:06,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:06,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:06,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:06,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:06,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:06,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:06,247 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-02 00:21:06,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:06,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:06,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:06,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:06,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:06,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:06,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:06,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:06,250 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-02 00:21:06,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:06,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:06,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:06,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:06,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:06,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:06,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:06,255 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-02 00:21:06,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:06,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:06,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:06,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:06,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:06,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:06,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:06,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:06,258 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-02 00:21:06,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:06,259 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:21:06,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:06,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:06,262 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:21:06,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:06,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:06,287 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-02 00:21:06,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:06,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:06,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:06,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:06,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:06,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:06,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:06,294 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:21:06,297 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:21:06,297 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:21:06,297 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:21:06,297 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:21:06,298 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:21:06,298 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2 Supporting invariants [] [2019-01-02 00:21:06,339 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-02 00:21:06,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-02 00:21:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:06,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:06,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:06,503 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-02 00:21:06,529 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-02 00:21:06,529 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-02 00:21:06,608 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 22 states and 29 transitions. Complement of second has 7 states. [2019-01-02 00:21:06,609 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-02 00:21:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:21:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-02 00:21:06,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-02 00:21:06,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:06,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-02 00:21:06,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:06,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-02 00:21:06,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:06,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2019-01-02 00:21:06,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:21:06,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 21 transitions. [2019-01-02 00:21:06,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-02 00:21:06,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-02 00:21:06,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-01-02 00:21:06,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:21:06,618 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-02 00:21:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-01-02 00:21:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-01-02 00:21:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-02 00:21:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-01-02 00:21:06,621 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-02 00:21:06,621 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-02 00:21:06,622 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:21:06,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-01-02 00:21:06,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:21:06,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:06,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:06,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:21:06,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:21:06,625 INFO L794 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 194#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 203#L557-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 195#L545-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 196#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 206#L548-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 205#L545-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 197#L545-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 199#L548-3 [2019-01-02 00:21:06,625 INFO L796 eck$LassoCheckResult]: Loop: 199#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 201#L548-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 199#L548-3 [2019-01-02 00:21:06,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:06,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2019-01-02 00:21:06,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:06,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:06,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:06,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:06,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:06,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:06,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2019-01-02 00:21:06,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:06,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:06,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:06,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:06,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:06,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:06,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2019-01-02 00:21:06,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:06,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:06,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:06,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:06,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:07,130 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-01-02 00:21:07,206 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:21:07,207 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:21:07,207 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:21:07,207 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:21:07,207 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:21:07,207 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:21:07,207 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:21:07,207 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:21:07,207 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2019-01-02 00:21:07,207 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:21:07,208 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:21:07,211 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-02 00:21:07,219 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-02 00:21:07,221 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-02 00:21:07,223 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-02 00:21:07,227 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-02 00:21:07,229 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-02 00:21:07,232 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-02 00:21:07,460 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-01-02 00:21:07,486 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-02 00:21:07,489 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-02 00:21:07,491 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-02 00:21:07,494 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-02 00:21:07,496 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-02 00:21:07,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-02 00:21:07,904 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:21:07,904 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:21:07,904 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-02 00:21:07,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:07,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:07,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:07,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:07,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:07,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:07,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:07,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:07,907 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-02 00:21:07,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:07,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:07,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:07,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:07,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:07,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:07,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:07,911 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-02 00:21:07,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:07,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:07,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:07,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:07,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:07,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:07,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:07,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:07,914 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-02 00:21:07,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:07,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:07,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:07,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:07,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:07,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:07,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:07,922 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-02 00:21:07,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:07,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:07,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:07,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:07,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:07,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:07,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:07,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:07,924 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-02 00:21:07,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:07,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:07,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:07,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:07,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:07,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:07,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:07,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:07,926 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-02 00:21:07,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:07,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:07,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:07,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:07,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:07,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:07,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:07,935 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-02 00:21:07,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:07,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:07,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:07,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:07,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:07,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:07,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:07,955 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-02 00:21:07,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:07,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:07,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:07,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:07,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:07,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:07,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:07,959 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:21:07,960 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:21:07,960 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:21:07,961 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:21:07,961 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:21:07,961 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:21:07,961 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3 Supporting invariants [] [2019-01-02 00:21:08,011 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-01-02 00:21:08,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-02 00:21:08,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:08,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:08,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:08,148 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-02 00:21:08,148 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-02 00:21:08,149 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-02 00:21:08,172 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2019-01-02 00:21:08,173 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-02 00:21:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:21:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-02 00:21:08,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-02 00:21:08,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:08,174 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:21:08,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:08,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:08,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:08,227 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-02 00:21:08,227 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-02 00:21:08,228 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-02 00:21:08,264 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2019-01-02 00:21:08,266 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-02 00:21:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:21:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-02 00:21:08,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-02 00:21:08,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:08,267 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:21:08,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:08,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:08,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:08,323 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-02 00:21:08,323 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-02 00:21:08,323 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-02 00:21:08,359 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2019-01-02 00:21:08,360 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-02 00:21:08,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:21:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-02 00:21:08,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-02 00:21:08,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:08,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-02 00:21:08,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:08,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-02 00:21:08,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:08,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-01-02 00:21:08,365 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:21:08,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-01-02 00:21:08,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:21:08,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:21:08,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:21:08,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:21:08,366 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:08,366 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:08,366 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:08,366 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:21:08,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:21:08,366 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:21:08,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:21:08,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:21:08 BoogieIcfgContainer [2019-01-02 00:21:08,375 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:21:08,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:21:08,375 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:21:08,376 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:21:08,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:21:02" (3/4) ... [2019-01-02 00:21:08,381 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:21:08,381 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:21:08,383 INFO L168 Benchmark]: Toolchain (without parser) took 7315.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -60.0 MB). Peak memory consumption was 158.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:08,384 INFO L168 Benchmark]: CDTParser took 0.45 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-02 00:21:08,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:08,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:08,387 INFO L168 Benchmark]: Boogie Preprocessor took 31.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:21:08,388 INFO L168 Benchmark]: RCFGBuilder took 430.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:08,389 INFO L168 Benchmark]: BuchiAutomizer took 6112.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.9 MB). Peak memory consumption was 175.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:08,389 INFO L168 Benchmark]: Witness Printer took 5.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:21:08,396 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.45 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 664.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 430.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6112.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.9 MB). Peak memory consumption was 175.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 59 SDtfs, 44 SDslu, 10 SDs, 0 SdLazy, 32 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital134 mio100 ax100 hnf98 lsp90 ukn83 mio100 lsp57 div100 bol100 ite100 ukn100 eq188 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...