./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sum05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/sum05-2.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 48db2505a59cdca75fbfbfb4403b26f347fcdcda ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:52:31,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:52:31,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:52:31,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:52:31,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:52:31,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:52:31,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:52:31,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:52:31,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:52:31,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:52:31,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:52:31,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:52:31,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:52:31,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:52:31,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:52:31,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:52:31,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:52:31,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:52:31,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:52:31,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:52:31,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:52:31,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:52:31,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:52:31,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:52:31,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:52:31,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:52:31,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:52:31,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:52:31,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:52:31,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:52:31,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:52:31,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:52:31,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:52:31,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:52:31,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:52:31,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:52:31,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:52:31,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:52:31,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:52:31,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:52:31,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:52:31,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:52:31,261 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:52:31,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:52:31,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:52:31,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:52:31,264 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:52:31,264 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:52:31,264 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:52:31,264 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:52:31,265 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:52:31,265 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:52:31,265 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:52:31,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:52:31,266 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:52:31,266 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:52:31,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:52:31,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:52:31,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:52:31,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:52:31,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:52:31,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:52:31,268 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:52:31,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:52:31,269 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:52:31,269 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:52:31,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:52:31,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:52:31,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:52:31,270 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:52:31,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:52:31,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:52:31,271 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:52:31,272 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:52:31,273 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 48db2505a59cdca75fbfbfb4403b26f347fcdcda [2019-11-28 03:52:31,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:52:31,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:52:31,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:52:31,597 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:52:31,598 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:52:31,599 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum05-2.i [2019-11-28 03:52:31,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d590fa351/e4d3780e3ed94e23ac717b2ec5784b60/FLAG55d1e0d9b [2019-11-28 03:52:32,170 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:52:32,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i [2019-11-28 03:52:32,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d590fa351/e4d3780e3ed94e23ac717b2ec5784b60/FLAG55d1e0d9b [2019-11-28 03:52:32,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d590fa351/e4d3780e3ed94e23ac717b2ec5784b60 [2019-11-28 03:52:32,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:52:32,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:52:32,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:52:32,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:52:32,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:52:32,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:32" (1/1) ... [2019-11-28 03:52:32,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6bb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:32, skipping insertion in model container [2019-11-28 03:52:32,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:32" (1/1) ... [2019-11-28 03:52:32,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:52:32,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:52:32,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:52:32,821 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:52:32,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:52:32,864 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:52:32,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:32 WrapperNode [2019-11-28 03:52:32,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:52:32,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:52:32,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:52:32,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:52:32,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:32" (1/1) ... [2019-11-28 03:52:32,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:32" (1/1) ... [2019-11-28 03:52:32,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:52:32,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:52:32,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:52:32,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:52:32,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:32" (1/1) ... [2019-11-28 03:52:32,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:32" (1/1) ... [2019-11-28 03:52:32,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:32" (1/1) ... [2019-11-28 03:52:32,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:32" (1/1) ... [2019-11-28 03:52:33,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:32" (1/1) ... [2019-11-28 03:52:33,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:32" (1/1) ... [2019-11-28 03:52:33,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:32" (1/1) ... [2019-11-28 03:52:33,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:52:33,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:52:33,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:52:33,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:52:33,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:52:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:52:33,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:52:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:52:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:52:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:52:33,404 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:52:33,404 INFO L297 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-28 03:52:33,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:33 BoogieIcfgContainer [2019-11-28 03:52:33,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:52:33,406 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:52:33,407 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:52:33,410 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:52:33,412 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:33,412 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:52:32" (1/3) ... [2019-11-28 03:52:33,413 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@179e000a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:33, skipping insertion in model container [2019-11-28 03:52:33,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:33,414 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:32" (2/3) ... [2019-11-28 03:52:33,414 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@179e000a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:33, skipping insertion in model container [2019-11-28 03:52:33,414 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:33,415 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:33" (3/3) ... [2019-11-28 03:52:33,418 INFO L371 chiAutomizerObserver]: Analyzing ICFG sum05-2.i [2019-11-28 03:52:33,479 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:52:33,479 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:52:33,479 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:52:33,479 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:52:33,480 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:52:33,480 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:52:33,480 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:52:33,480 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:52:33,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-28 03:52:33,526 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-28 03:52:33,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:33,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:33,543 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:52:33,544 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:33,547 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:52:33,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-28 03:52:33,550 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-28 03:52:33,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:33,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:33,554 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:52:33,555 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:33,573 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 26#L23-3true [2019-11-28 03:52:33,573 INFO L796 eck$LassoCheckResult]: Loop: 26#L23-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 9#L23-2true main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26#L23-3true [2019-11-28 03:52:33,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:33,588 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:52:33,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:33,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842930550] [2019-11-28 03:52:33,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:33,709 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:33,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:33,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-28 03:52:33,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:33,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915862865] [2019-11-28 03:52:33,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:33,740 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:33,746 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-28 03:52:33,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:33,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481580314] [2019-11-28 03:52:33,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:33,786 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:33,974 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:33,976 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:33,976 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:33,976 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:33,977 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:33,977 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:33,977 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:33,977 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:33,977 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration1_Lasso [2019-11-28 03:52:33,977 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:33,978 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:34,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,342 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:34,347 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:34,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:34,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:34,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:34,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:34,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:34,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:34,480 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:34,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,496 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:34,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:34,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:34,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:34,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:34,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:34,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:34,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:34,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:34,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:34,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:34,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:34,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:34,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:34,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:34,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:34,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:34,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:34,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:34,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:34,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:34,838 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:34,872 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-28 03:52:34,873 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:34,880 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,885 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:34,885 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:34,886 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 9 Supporting invariants [] [2019-11-28 03:52:34,897 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-28 03:52:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:34,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:34,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:34,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:34,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:35,001 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-11-28 03:52:35,002 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2019-11-28 03:52:35,065 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 69 states and 95 transitions. Complement of second has 7 states. [2019-11-28 03:52:35,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:52:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:52:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2019-11-28 03:52:35,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-28 03:52:35,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:35,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 03:52:35,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:35,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-28 03:52:35,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:35,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 95 transitions. [2019-11-28 03:52:35,080 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:35,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 19 states and 24 transitions. [2019-11-28 03:52:35,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 03:52:35,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:52:35,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2019-11-28 03:52:35,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:35,088 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 03:52:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2019-11-28 03:52:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-28 03:52:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 03:52:35,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-28 03:52:35,120 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 03:52:35,120 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 03:52:35,120 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:52:35,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-28 03:52:35,122 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:35,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:35,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:35,123 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:52:35,123 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:35,123 INFO L794 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 150#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 147#L23-3 assume !(main_~i~1 < 5); 146#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 139#L9-3 [2019-11-28 03:52:35,124 INFO L796 eck$LassoCheckResult]: Loop: 139#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 140#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 139#L9-3 [2019-11-28 03:52:35,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:35,124 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-28 03:52:35,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:35,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651522561] [2019-11-28 03:52:35,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:35,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651522561] [2019-11-28 03:52:35,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:52:35,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:52:35,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755360351] [2019-11-28 03:52:35,172 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:35,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:35,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2019-11-28 03:52:35,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:35,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365600076] [2019-11-28 03:52:35,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,185 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:35,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:35,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:52:35,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:52:35,244 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 03:52:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:35,258 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-11-28 03:52:35,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:52:35,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-11-28 03:52:35,261 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:35,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2019-11-28 03:52:35,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 03:52:35,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:52:35,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2019-11-28 03:52:35,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:35,263 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-28 03:52:35,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2019-11-28 03:52:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-28 03:52:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 03:52:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-11-28 03:52:35,265 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-28 03:52:35,265 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-28 03:52:35,265 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:52:35,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2019-11-28 03:52:35,266 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:35,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:35,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:35,267 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:52:35,267 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:35,268 INFO L794 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 195#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 192#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 193#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 194#L23-3 assume !(main_~i~1 < 5); 191#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 184#L9-3 [2019-11-28 03:52:35,268 INFO L796 eck$LassoCheckResult]: Loop: 184#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 185#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 184#L9-3 [2019-11-28 03:52:35,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:35,268 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-28 03:52:35,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:35,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497122094] [2019-11-28 03:52:35,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:35,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497122094] [2019-11-28 03:52:35,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257969931] [2019-11-28 03:52:35,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:35,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 03:52:35,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:35,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:35,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-28 03:52:35,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572484605] [2019-11-28 03:52:35,363 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:35,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:35,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2019-11-28 03:52:35,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:35,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348419651] [2019-11-28 03:52:35,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,374 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:35,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:35,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:52:35,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:52:35,404 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-28 03:52:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:35,429 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-11-28 03:52:35,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:52:35,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2019-11-28 03:52:35,431 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:35,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2019-11-28 03:52:35,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 03:52:35,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:52:35,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2019-11-28 03:52:35,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:35,433 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-28 03:52:35,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2019-11-28 03:52:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-28 03:52:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 03:52:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-28 03:52:35,436 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-28 03:52:35,436 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-28 03:52:35,436 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:52:35,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2019-11-28 03:52:35,437 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:35,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:35,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:35,437 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-28 03:52:35,438 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:35,438 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 260#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 256#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 257#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 258#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 259#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 266#L23-3 assume !(main_~i~1 < 5); 255#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 248#L9-3 [2019-11-28 03:52:35,438 INFO L796 eck$LassoCheckResult]: Loop: 248#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 249#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 248#L9-3 [2019-11-28 03:52:35,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:35,438 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-11-28 03:52:35,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:35,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350766662] [2019-11-28 03:52:35,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:35,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350766662] [2019-11-28 03:52:35,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115589145] [2019-11-28 03:52:35,506 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:35,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:52:35,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:52:35,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:35,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:35,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:35,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-28 03:52:35,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884021011] [2019-11-28 03:52:35,582 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:35,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2019-11-28 03:52:35,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:35,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97727383] [2019-11-28 03:52:35,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,602 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:35,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:35,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:52:35,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:52:35,646 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-11-28 03:52:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:35,679 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-11-28 03:52:35,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:52:35,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2019-11-28 03:52:35,682 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:35,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2019-11-28 03:52:35,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 03:52:35,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:52:35,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-11-28 03:52:35,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:35,686 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-28 03:52:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-11-28 03:52:35,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-28 03:52:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:52:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-28 03:52:35,689 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-28 03:52:35,690 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-28 03:52:35,690 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:52:35,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-11-28 03:52:35,693 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:35,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:35,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:35,697 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-28 03:52:35,697 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:35,698 INFO L794 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 335#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 331#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 332#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 333#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 334#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 343#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 342#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 341#L23-3 assume !(main_~i~1 < 5); 330#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 323#L9-3 [2019-11-28 03:52:35,698 INFO L796 eck$LassoCheckResult]: Loop: 323#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 324#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 323#L9-3 [2019-11-28 03:52:35,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:35,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-11-28 03:52:35,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:35,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978663958] [2019-11-28 03:52:35,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:35,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978663958] [2019-11-28 03:52:35,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446768788] [2019-11-28 03:52:35,785 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:35,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 03:52:35,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:52:35,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:52:35,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:35,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:35,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-28 03:52:35,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346281706] [2019-11-28 03:52:35,869 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:35,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:35,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2019-11-28 03:52:35,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:35,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315639015] [2019-11-28 03:52:35,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,888 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:35,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:35,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:52:35,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:52:35,921 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-11-28 03:52:35,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:35,954 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-11-28 03:52:35,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:52:35,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2019-11-28 03:52:35,958 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:35,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2019-11-28 03:52:35,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 03:52:35,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:52:35,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2019-11-28 03:52:35,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:35,960 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-28 03:52:35,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2019-11-28 03:52:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-28 03:52:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 03:52:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-28 03:52:35,965 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-28 03:52:35,965 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-28 03:52:35,965 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:52:35,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2019-11-28 03:52:35,966 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:35,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:35,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:35,968 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-28 03:52:35,969 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:35,970 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 421#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 417#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 418#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 419#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 420#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 422#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 431#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 430#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 429#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 428#L23-3 assume !(main_~i~1 < 5); 416#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 409#L9-3 [2019-11-28 03:52:35,970 INFO L796 eck$LassoCheckResult]: Loop: 409#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 410#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 409#L9-3 [2019-11-28 03:52:35,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-11-28 03:52:35,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:35,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372713409] [2019-11-28 03:52:35,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:36,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372713409] [2019-11-28 03:52:36,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696476736] [2019-11-28 03:52:36,087 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:36,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 03:52:36,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:52:36,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:52:36,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:36,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:36,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-28 03:52:36,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969758204] [2019-11-28 03:52:36,172 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:36,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:36,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2019-11-28 03:52:36,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:36,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292819562] [2019-11-28 03:52:36,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:36,184 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:36,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:36,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 03:52:36,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-28 03:52:36,229 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2019-11-28 03:52:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:36,267 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-11-28 03:52:36,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:52:36,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2019-11-28 03:52:36,268 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:36,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2019-11-28 03:52:36,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 03:52:36,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:52:36,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2019-11-28 03:52:36,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:36,270 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-28 03:52:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2019-11-28 03:52:36,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 03:52:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 03:52:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-28 03:52:36,273 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-28 03:52:36,273 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-28 03:52:36,273 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:52:36,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-11-28 03:52:36,273 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:36,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:36,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:36,274 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-11-28 03:52:36,274 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:36,275 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 517#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 513#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 514#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 515#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 516#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 518#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 529#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 528#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 527#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 526#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 525#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 524#L23-3 assume !(main_~i~1 < 5); 512#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 505#L9-3 [2019-11-28 03:52:36,275 INFO L796 eck$LassoCheckResult]: Loop: 505#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 506#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 505#L9-3 [2019-11-28 03:52:36,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:36,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-11-28 03:52:36,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:36,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766461707] [2019-11-28 03:52:36,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:36,305 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:36,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:36,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2019-11-28 03:52:36,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:36,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81500484] [2019-11-28 03:52:36,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:36,314 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:36,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:36,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2019-11-28 03:52:36,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:36,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053692451] [2019-11-28 03:52:36,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:36,387 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:36,941 WARN L192 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 101 [2019-11-28 03:52:37,053 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:37,053 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:37,053 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:37,054 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:37,054 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:37,054 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:37,054 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:37,054 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:37,054 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration7_Lasso [2019-11-28 03:52:37,054 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:37,055 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:37,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,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-11-28 03:52:37,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,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-11-28 03:52:37,523 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:37,523 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:37,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:37,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:37,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:37,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:37,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:37,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:37,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:37,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:37,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:37,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:37,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:37,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:37,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:37,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:37,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:37,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:37,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:37,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:37,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:37,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:37,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:37,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:37,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:37,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:37,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:37,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:37,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:37,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:37,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:37,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:37,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:37,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:37,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:37,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:37,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:37,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:37,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:37,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:37,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:37,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:37,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:37,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:37,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:37,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:37,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:37,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:37,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:37,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:37,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:37,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:37,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:37,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:37,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:37,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:37,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:37,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:37,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:37,688 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:37,711 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 03:52:37,711 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:37,722 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:37,725 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:37,726 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:37,726 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0) = -2*ULTIMATE.start_sum_~i~0 + 9 Supporting invariants [] [2019-11-28 03:52:37,742 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 03:52:37,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:37,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:37,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:37,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:37,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:37,816 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-11-28 03:52:37,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-28 03:52:37,835 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 7 states. [2019-11-28 03:52:37,836 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-11-28 03:52:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:52:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-28 03:52:37,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-28 03:52:37,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:37,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-28 03:52:37,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:37,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-28 03:52:37,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:37,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-11-28 03:52:37,839 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:37,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2019-11-28 03:52:37,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:52:37,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 03:52:37,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2019-11-28 03:52:37,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:37,841 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-28 03:52:37,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2019-11-28 03:52:37,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 03:52:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 03:52:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-28 03:52:37,843 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-28 03:52:37,843 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-28 03:52:37,843 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:52:37,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2019-11-28 03:52:37,844 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:37,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:37,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:37,845 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:37,845 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:37,846 INFO L794 eck$LassoCheckResult]: Stem: 662#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 660#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 656#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 657#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 658#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 659#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 661#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 672#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 671#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 670#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 669#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 668#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 667#L23-3 assume !(main_~i~1 < 5); 655#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 647#L9-3 assume !(sum_~i~0 < 5); 645#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 646#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 665#L9-8 [2019-11-28 03:52:37,846 INFO L796 eck$LassoCheckResult]: Loop: 665#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 666#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 665#L9-8 [2019-11-28 03:52:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:37,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581027, now seen corresponding path program 1 times [2019-11-28 03:52:37,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:37,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510914388] [2019-11-28 03:52:37,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 03:52:37,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510914388] [2019-11-28 03:52:37,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:52:37,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:52:37,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133030921] [2019-11-28 03:52:37,877 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:37,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:37,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2019-11-28 03:52:37,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:37,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944720385] [2019-11-28 03:52:37,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:37,884 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:37,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:37,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:52:37,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:52:37,911 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 03:52:37,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:37,939 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-11-28 03:52:37,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:52:37,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2019-11-28 03:52:37,940 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:37,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2019-11-28 03:52:37,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 03:52:37,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 03:52:37,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2019-11-28 03:52:37,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:37,942 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-28 03:52:37,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2019-11-28 03:52:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-11-28 03:52:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 03:52:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-28 03:52:37,944 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-28 03:52:37,944 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-28 03:52:37,944 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:52:37,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2019-11-28 03:52:37,945 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:37,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:37,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:37,946 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:37,946 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:37,946 INFO L794 eck$LassoCheckResult]: Stem: 728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 727#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 723#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 724#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 725#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 726#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 740#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 739#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 738#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 737#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 736#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 735#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 734#L23-3 assume !(main_~i~1 < 5); 722#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 714#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 715#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 716#L9-3 assume !(sum_~i~0 < 5); 712#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 713#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 731#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 732#L9-7 [2019-11-28 03:52:37,946 INFO L796 eck$LassoCheckResult]: Loop: 732#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 733#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 732#L9-7 [2019-11-28 03:52:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1577614809, now seen corresponding path program 1 times [2019-11-28 03:52:37,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:37,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811958438] [2019-11-28 03:52:37,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 03:52:37,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811958438] [2019-11-28 03:52:37,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315675347] [2019-11-28 03:52:37,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:38,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 03:52:38,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 03:52:38,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:38,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-28 03:52:38,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075295680] [2019-11-28 03:52:38,043 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:38,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:38,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2019-11-28 03:52:38,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:38,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749245580] [2019-11-28 03:52:38,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:38,053 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:38,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:38,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:52:38,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:52:38,079 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-28 03:52:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:38,120 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-11-28 03:52:38,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:52:38,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2019-11-28 03:52:38,122 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:38,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 43 transitions. [2019-11-28 03:52:38,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 03:52:38,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 03:52:38,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2019-11-28 03:52:38,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:38,124 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-28 03:52:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2019-11-28 03:52:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-11-28 03:52:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 03:52:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-28 03:52:38,126 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-28 03:52:38,126 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-28 03:52:38,126 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:52:38,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2019-11-28 03:52:38,127 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:38,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:38,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:38,128 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:38,128 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:38,128 INFO L794 eck$LassoCheckResult]: Stem: 866#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 862#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 858#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 859#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 860#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 861#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 863#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 876#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 875#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 874#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 873#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 872#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 871#L23-3 assume !(main_~i~1 < 5); 857#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 847#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 848#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 849#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 850#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 854#L9-3 assume !(sum_~i~0 < 5); 845#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 846#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 869#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 870#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 867#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 868#L9-7 [2019-11-28 03:52:38,129 INFO L796 eck$LassoCheckResult]: Loop: 868#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 877#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 868#L9-7 [2019-11-28 03:52:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash -483964569, now seen corresponding path program 1 times [2019-11-28 03:52:38,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:38,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567779279] [2019-11-28 03:52:38,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 03:52:38,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567779279] [2019-11-28 03:52:38,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164335587] [2019-11-28 03:52:38,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:38,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:38,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 03:52:38,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:38,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-28 03:52:38,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015433885] [2019-11-28 03:52:38,270 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:38,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:38,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2019-11-28 03:52:38,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:38,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821136357] [2019-11-28 03:52:38,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:38,283 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:38,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:38,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:52:38,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:52:38,332 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-11-28 03:52:38,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:38,387 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-11-28 03:52:38,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:52:38,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 49 transitions. [2019-11-28 03:52:38,389 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:38,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 49 transitions. [2019-11-28 03:52:38,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 03:52:38,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 03:52:38,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 49 transitions. [2019-11-28 03:52:38,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:38,391 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-28 03:52:38,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 49 transitions. [2019-11-28 03:52:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2019-11-28 03:52:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 03:52:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-28 03:52:38,395 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-28 03:52:38,395 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-28 03:52:38,395 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:52:38,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2019-11-28 03:52:38,396 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:38,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:38,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:38,397 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:38,397 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:38,397 INFO L794 eck$LassoCheckResult]: Stem: 1021#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1018#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1014#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1015#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1016#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1017#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1036#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1035#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1033#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1032#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1031#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1030#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1029#L23-3 assume !(main_~i~1 < 5); 1013#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1003#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1004#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1005#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1006#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1010#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1028#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1027#L9-3 assume !(sum_~i~0 < 5); 1001#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1002#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1024#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1025#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1026#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1037#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1022#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1023#L9-7 [2019-11-28 03:52:38,397 INFO L796 eck$LassoCheckResult]: Loop: 1023#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1034#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1023#L9-7 [2019-11-28 03:52:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:38,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1757450151, now seen corresponding path program 2 times [2019-11-28 03:52:38,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:38,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9713157] [2019-11-28 03:52:38,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-28 03:52:38,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9713157] [2019-11-28 03:52:38,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32330695] [2019-11-28 03:52:38,454 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:38,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:52:38,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:52:38,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:52:38,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-28 03:52:38,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:38,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-28 03:52:38,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949813395] [2019-11-28 03:52:38,542 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:38,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2019-11-28 03:52:38,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:38,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394596209] [2019-11-28 03:52:38,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:38,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:38,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:38,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:52:38,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:52:38,609 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-11-28 03:52:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:38,694 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-11-28 03:52:38,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:52:38,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2019-11-28 03:52:38,695 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:38,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 55 transitions. [2019-11-28 03:52:38,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-28 03:52:38,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-11-28 03:52:38,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 55 transitions. [2019-11-28 03:52:38,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:38,697 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-11-28 03:52:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 55 transitions. [2019-11-28 03:52:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2019-11-28 03:52:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 03:52:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-28 03:52:38,701 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-28 03:52:38,701 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-28 03:52:38,701 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 03:52:38,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2019-11-28 03:52:38,702 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:38,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:38,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:38,703 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:38,703 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:38,703 INFO L794 eck$LassoCheckResult]: Stem: 1199#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1196#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1192#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1193#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1194#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1195#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1213#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1212#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1209#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1208#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1207#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1206#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1205#L23-3 assume !(main_~i~1 < 5); 1191#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1182#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1183#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1184#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1185#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1216#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1215#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1214#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1204#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1203#L9-3 assume !(sum_~i~0 < 5); 1180#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1181#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1200#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1201#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1202#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1220#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1219#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1218#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1217#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1211#L9-7 [2019-11-28 03:52:38,703 INFO L796 eck$LassoCheckResult]: Loop: 1211#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1210#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1211#L9-7 [2019-11-28 03:52:38,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1218450663, now seen corresponding path program 3 times [2019-11-28 03:52:38,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:38,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098731560] [2019-11-28 03:52:38,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-28 03:52:38,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098731560] [2019-11-28 03:52:38,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446475419] [2019-11-28 03:52:38,761 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:38,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 03:52:38,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:52:38,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:52:38,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-28 03:52:38,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:38,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-28 03:52:38,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371389964] [2019-11-28 03:52:38,852 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:38,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:38,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2019-11-28 03:52:38,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:38,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96786983] [2019-11-28 03:52:38,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:38,861 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:38,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:38,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 03:52:38,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-28 03:52:38,894 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. cyclomatic complexity: 9 Second operand 8 states. [2019-11-28 03:52:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:39,005 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-28 03:52:39,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:52:39,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 58 transitions. [2019-11-28 03:52:39,007 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:39,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 58 transitions. [2019-11-28 03:52:39,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-28 03:52:39,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-28 03:52:39,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions. [2019-11-28 03:52:39,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:39,008 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-28 03:52:39,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions. [2019-11-28 03:52:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-11-28 03:52:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 03:52:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-28 03:52:39,016 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-28 03:52:39,016 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-28 03:52:39,016 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 03:52:39,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 49 transitions. [2019-11-28 03:52:39,020 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:39,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:39,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:39,022 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:39,023 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:39,023 INFO L794 eck$LassoCheckResult]: Stem: 1397#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1396#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1392#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1393#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1394#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1395#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1418#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1416#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1414#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1412#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1410#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1408#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1407#L23-3 assume !(main_~i~1 < 5); 1391#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1381#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1382#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1383#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1384#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1388#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1423#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1422#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1421#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1420#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1404#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1403#L9-3 assume !(sum_~i~0 < 5); 1379#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1380#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1400#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1401#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1402#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1419#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1417#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1415#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1413#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1411#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1409#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1406#L9-7 [2019-11-28 03:52:39,023 INFO L796 eck$LassoCheckResult]: Loop: 1406#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1405#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1406#L9-7 [2019-11-28 03:52:39,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:39,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2144167641, now seen corresponding path program 4 times [2019-11-28 03:52:39,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:39,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093055626] [2019-11-28 03:52:39,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:39,203 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:39,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:39,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2019-11-28 03:52:39,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:39,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671641652] [2019-11-28 03:52:39,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:39,210 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:39,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:39,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1039200421, now seen corresponding path program 5 times [2019-11-28 03:52:39,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:39,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117702634] [2019-11-28 03:52:39,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-28 03:52:39,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117702634] [2019-11-28 03:52:39,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:52:39,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 03:52:39,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630879695] [2019-11-28 03:52:39,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:39,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 03:52:39,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 03:52:39,350 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. cyclomatic complexity: 9 Second operand 10 states. [2019-11-28 03:52:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:39,532 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-28 03:52:39,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:52:39,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2019-11-28 03:52:39,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:52:39,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 43 transitions. [2019-11-28 03:52:39,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 03:52:39,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-11-28 03:52:39,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 43 transitions. [2019-11-28 03:52:39,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:39,535 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-11-28 03:52:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 43 transitions. [2019-11-28 03:52:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-28 03:52:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 03:52:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-11-28 03:52:39,538 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-11-28 03:52:39,538 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-11-28 03:52:39,538 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-28 03:52:39,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 43 transitions. [2019-11-28 03:52:39,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:52:39,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:39,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:39,540 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:39,540 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:39,540 INFO L794 eck$LassoCheckResult]: Stem: 1520#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1517#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1513#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1514#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1515#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1516#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1538#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1537#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1535#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1533#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1531#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1528#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1527#L23-3 assume !(main_~i~1 < 5); 1512#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1507#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1508#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1509#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1536#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1534#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1532#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1530#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1529#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1526#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1525#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1524#L9-3 assume !(sum_~i~0 < 5); 1505#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1506#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1521#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1522#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1523#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1546#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1545#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1544#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1543#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1542#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1541#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1540#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1539#L9-8 assume !(sum_~i~0 < 5); 1518#L9-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1519#L12-1 main_#t~ret7 := sum_#res;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 1510#L32-3 [2019-11-28 03:52:39,540 INFO L796 eck$LassoCheckResult]: Loop: 1510#L32-3 assume !!(main_~i~2 < 4);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 1511#L32-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 1510#L32-3 [2019-11-28 03:52:39,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:39,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2055775835, now seen corresponding path program 1 times [2019-11-28 03:52:39,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:39,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854525360] [2019-11-28 03:52:39,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:39,619 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:39,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:39,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2019-11-28 03:52:39,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:39,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711933570] [2019-11-28 03:52:39,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:39,625 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:39,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:39,625 INFO L82 PathProgramCache]: Analyzing trace with hash 84380519, now seen corresponding path program 1 times [2019-11-28 03:52:39,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:39,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451012665] [2019-11-28 03:52:39,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:39,721 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:42,846 WARN L192 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 352 DAG size of output: 251 [2019-11-28 03:52:45,022 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 139 DAG size of output: 136 [2019-11-28 03:52:45,033 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:45,033 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:45,034 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:45,034 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:45,034 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:45,034 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:45,034 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:45,034 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:45,034 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration14_Lasso [2019-11-28 03:52:45,034 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:45,034 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:45,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:45,741 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-28 03:52:46,393 WARN L192 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 93 [2019-11-28 03:52:46,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:46,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:46,976 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-11-28 03:52:47,693 WARN L192 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-28 03:52:47,725 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:47,725 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:47,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:47,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:47,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,740 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:47,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:47,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:47,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:47,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:47,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:47,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:47,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:47,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:47,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:47,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:47,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:47,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:47,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:47,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:47,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:47,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:47,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:47,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:47,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:47,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:47,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:47,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:47,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:47,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:47,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:47,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:47,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:47,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:47,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:47,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:47,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:47,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:47,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:47,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:47,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:47,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:47,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:47,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:47,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:47,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:47,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:47,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:47,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:47,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:47,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:47,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:47,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:47,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:47,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:47,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:47,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:47,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:47,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:47,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:47,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:48,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:48,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:48,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:48,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:48,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:48,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:48,034 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:48,059 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-28 03:52:48,060 INFO L444 ModelExtractionUtils]: 1 out of 25 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:48,065 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:52:48,067 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:48,067 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:48,067 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2019-11-28 03:52:48,253 INFO L297 tatePredicateManager]: 39 out of 39 supporting invariants were superfluous and have been removed [2019-11-28 03:52:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:48,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:48,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:48,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:48,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:48,345 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-11-28 03:52:48,345 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-11-28 03:52:48,361 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 44 states and 46 transitions. Complement of second has 4 states. [2019-11-28 03:52:48,361 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-11-28 03:52:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:52:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-28 03:52:48,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 2 letters. [2019-11-28 03:52:48,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:48,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 42 letters. Loop has 2 letters. [2019-11-28 03:52:48,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:48,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 4 letters. [2019-11-28 03:52:48,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:48,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2019-11-28 03:52:48,364 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:52:48,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2019-11-28 03:52:48,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:52:48,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:52:48,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:52:48,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:48,365 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:52:48,365 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:52:48,365 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:52:48,365 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-28 03:52:48,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:52:48,366 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:52:48,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:52:48,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:52:48 BoogieIcfgContainer [2019-11-28 03:52:48,373 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:52:48,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:52:48,375 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:52:48,375 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:52:48,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:33" (3/4) ... [2019-11-28 03:52:48,379 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:52:48,379 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:52:48,381 INFO L168 Benchmark]: Toolchain (without parser) took 15847.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 367.0 MB). Free memory was 953.7 MB in the beginning and 1.3 GB in the end (delta: -352.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:48,381 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:52:48,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.08 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 942.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:48,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:48,383 INFO L168 Benchmark]: Boogie Preprocessor took 42.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:48,383 INFO L168 Benchmark]: RCFGBuilder took 388.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:48,383 INFO L168 Benchmark]: BuchiAutomizer took 14966.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 225.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -193.3 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:48,384 INFO L168 Benchmark]: Witness Printer took 4.64 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:52:48,386 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.08 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 942.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 388.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14966.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 225.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -193.3 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.64 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 9 and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.9s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 13.5s. Construction of modules took 0.4s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 41 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 238 SDtfs, 190 SDslu, 454 SDs, 0 SdLazy, 300 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital555 mio100 ax100 hnf99 lsp125 ukn44 mio100 lsp59 div101 bol100 ite100 ukn100 eq167 hnf85 smp91 dnf196 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...