./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 906a4fb5 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 eba670f8bd1fa8791e65a0e1ec2f8a5c20095daa ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 20:24:35,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:24:35,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:24:35,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:24:35,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:24:35,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:24:35,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:24:35,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:24:35,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:24:35,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:24:35,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:24:35,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:24:35,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:24:35,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:24:35,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:24:35,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:24:35,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:24:35,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:24:35,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:24:35,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:24:35,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:24:35,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:24:35,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:24:35,449 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:24:35,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:24:35,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:24:35,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:24:35,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:24:35,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:24:35,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:24:35,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:24:35,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:24:35,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:24:35,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:24:35,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:24:35,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:24:35,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:24:35,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:24:35,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:24:35,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:24:35,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:24:35,484 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 20:24:35,509 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:24:35,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:24:35,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:24:35,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:24:35,512 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:24:35,512 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:24:35,512 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:24:35,513 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:24:35,513 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:24:35,513 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:24:35,514 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:24:35,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:24:35,514 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:24:35,514 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:24:35,515 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:24:35,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:24:35,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:24:35,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:24:35,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:24:35,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:24:35,516 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:24:35,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:24:35,517 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:24:35,517 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:24:35,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:24:35,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:24:35,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:24:35,519 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:24:35,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:24:35,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:24:35,519 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:24:35,520 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:24:35,521 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:24:35,521 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 -> eba670f8bd1fa8791e65a0e1ec2f8a5c20095daa [2020-10-19 20:24:35,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:24:35,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:24:35,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:24:35,879 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:24:35,880 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:24:35,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum05-2.i [2020-10-19 20:24:35,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07c6159f0/d29ecd852f3448588aaec07d684892f7/FLAGb95828726 [2020-10-19 20:24:36,398 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:24:36,399 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i [2020-10-19 20:24:36,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07c6159f0/d29ecd852f3448588aaec07d684892f7/FLAGb95828726 [2020-10-19 20:24:36,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07c6159f0/d29ecd852f3448588aaec07d684892f7 [2020-10-19 20:24:36,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:24:36,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:24:36,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:24:36,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:24:36,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:24:36,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:24:36" (1/1) ... [2020-10-19 20:24:36,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a333c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:36, skipping insertion in model container [2020-10-19 20:24:36,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:24:36" (1/1) ... [2020-10-19 20:24:36,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:24:36,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:24:37,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:24:37,115 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:24:37,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:24:37,245 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:24:37,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:37 WrapperNode [2020-10-19 20:24:37,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:24:37,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:24:37,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:24:37,247 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:24:37,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:37" (1/1) ... [2020-10-19 20:24:37,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:37" (1/1) ... [2020-10-19 20:24:37,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:24:37,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:24:37,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:24:37,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:24:37,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:37" (1/1) ... [2020-10-19 20:24:37,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:37" (1/1) ... [2020-10-19 20:24:37,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:37" (1/1) ... [2020-10-19 20:24:37,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:37" (1/1) ... [2020-10-19 20:24:37,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:37" (1/1) ... [2020-10-19 20:24:37,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:37" (1/1) ... [2020-10-19 20:24:37,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:37" (1/1) ... [2020-10-19 20:24:37,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:24:37,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:24:37,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:24:37,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:24:37,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:37" (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 [2020-10-19 20:24:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 20:24:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:24:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 20:24:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:24:37,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:24:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 20:24:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 20:24:37,729 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:24:37,730 INFO L298 CfgBuilder]: Removed 17 assume(true) statements. [2020-10-19 20:24:37,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:24:37 BoogieIcfgContainer [2020-10-19 20:24:37,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:24:37,733 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:24:37,734 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:24:37,739 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:24:37,740 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:24:37,740 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:24:36" (1/3) ... [2020-10-19 20:24:37,742 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f3111a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:24:37, skipping insertion in model container [2020-10-19 20:24:37,742 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:24:37,743 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:24:37" (2/3) ... [2020-10-19 20:24:37,744 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f3111a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:24:37, skipping insertion in model container [2020-10-19 20:24:37,744 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:24:37,744 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:24:37" (3/3) ... [2020-10-19 20:24:37,747 INFO L373 chiAutomizerObserver]: Analyzing ICFG sum05-2.i [2020-10-19 20:24:37,805 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:24:37,805 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:24:37,806 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:24:37,806 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:24:37,806 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:24:37,807 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:24:37,807 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:24:37,807 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:24:37,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-10-19 20:24:37,851 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2020-10-19 20:24:37,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:37,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:37,861 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 20:24:37,861 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:37,862 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:24:37,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-10-19 20:24:37,865 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2020-10-19 20:24:37,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:37,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:37,866 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 20:24:37,867 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:37,875 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, 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; 9#L34-3true [2020-10-19 20:24:37,876 INFO L796 eck$LassoCheckResult]: Loop: 9#L34-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 11#L34-2true main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 9#L34-3true [2020-10-19 20:24:37,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 20:24:37,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:37,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501001690] [2020-10-19 20:24:37,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:38,009 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:38,025 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:38,047 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:38,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:38,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-19 20:24:38,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:38,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898520654] [2020-10-19 20:24:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:38,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:38,068 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:38,071 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:38,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:38,073 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-19 20:24:38,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:38,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699769504] [2020-10-19 20:24:38,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:38,097 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:38,116 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:38,121 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:38,412 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-10-19 20:24:38,508 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:24:38,509 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:24:38,509 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:24:38,509 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:24:38,509 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:24:38,510 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:38,510 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:24:38,510 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:24:38,510 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration1_Lasso [2020-10-19 20:24:38,510 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:24:38,511 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:24:38,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,742 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-10-19 20:24:38,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:38,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:39,130 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:24:39,136 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) [2020-10-19 20:24:39,143 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 [2020-10-19 20:24:39,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:39,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:39,151 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 [2020-10-19 20:24:39,160 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) [2020-10-19 20:24:39,208 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 [2020-10-19 20:24:39,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:39,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:39,216 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 [2020-10-19 20:24:39,219 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) [2020-10-19 20:24:39,267 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 [2020-10-19 20:24:39,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:39,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:39,273 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 [2020-10-19 20:24:39,277 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) [2020-10-19 20:24:39,326 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 [2020-10-19 20:24:39,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:39,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:39,340 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) [2020-10-19 20:24:39,380 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 [2020-10-19 20:24:39,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:39,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:39,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:39,387 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) [2020-10-19 20:24:39,439 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 [2020-10-19 20:24:39,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:39,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:39,443 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 [2020-10-19 20:24:39,445 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) [2020-10-19 20:24:39,484 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 [2020-10-19 20:24:39,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:39,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:39,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:39,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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 [2020-10-19 20:24:39,519 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 [2020-10-19 20:24:39,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:39,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:39,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2020-10-19 20:24:39,580 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 [2020-10-19 20:24:39,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:39,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:39,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 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 [2020-10-19 20:24:39,636 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 [2020-10-19 20:24:39,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:39,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:39,647 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) [2020-10-19 20:24:39,687 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:39,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:39,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:39,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:39,693 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 [2020-10-19 20:24:39,719 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 [2020-10-19 20:24:39,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:39,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:39,732 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) [2020-10-19 20:24:39,782 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 [2020-10-19 20:24:39,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:39,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:39,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:39,839 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 [2020-10-19 20:24:39,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:39,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:39,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:39,874 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 [2020-10-19 20:24:39,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:39,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:39,892 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 [2020-10-19 20:24:39,920 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 [2020-10-19 20:24:39,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:39,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:39,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:39,926 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 [2020-10-19 20:24:39,952 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 [2020-10-19 20:24:39,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:39,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:39,961 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 [2020-10-19 20:24:39,985 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 [2020-10-19 20:24:39,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:39,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:39,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:39,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:39,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:39,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:40,001 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 [2020-10-19 20:24:40,027 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 [2020-10-19 20:24:40,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:40,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:40,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:40,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:40,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:40,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:40,053 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:24:40,207 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-19 20:24:40,208 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. 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 [2020-10-19 20:24:40,225 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:24:40,228 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:24:40,229 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:24:40,230 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2020-10-19 20:24:40,287 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-19 20:24:40,302 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:24:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:40,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:24:40,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:40,364 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 20:24:40,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:40,422 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 [2020-10-19 20:24:40,424 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 3 states. [2020-10-19 20:24:40,582 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 3 states. Result 69 states and 97 transitions. Complement of second has 8 states. [2020-10-19 20:24:40,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:24:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:24:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2020-10-19 20:24:40,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-19 20:24:40,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:40,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-19 20:24:40,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:40,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-19 20:24:40,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:40,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 97 transitions. [2020-10-19 20:24:40,597 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 20:24:40,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 19 states and 24 transitions. [2020-10-19 20:24:40,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 20:24:40,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:24:40,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2020-10-19 20:24:40,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:40,606 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-19 20:24:40,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2020-10-19 20:24:40,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-10-19 20:24:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-19 20:24:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-10-19 20:24:40,637 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-19 20:24:40,637 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-19 20:24:40,637 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:24:40,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-10-19 20:24:40,639 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 20:24:40,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:40,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:40,640 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 20:24:40,640 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:40,640 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 176#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, 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; 173#L34-3 assume !(main_~i~1 < 5); 172#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, 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; 165#L20-3 [2020-10-19 20:24:40,641 INFO L796 eck$LassoCheckResult]: Loop: 165#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 166#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 165#L20-3 [2020-10-19 20:24:40,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:40,641 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-10-19 20:24:40,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:40,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34680829] [2020-10-19 20:24:40,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:40,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34680829] [2020-10-19 20:24:40,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:24:40,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:24:40,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581660405] [2020-10-19 20:24:40,698 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:40,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:40,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2020-10-19 20:24:40,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:40,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253110170] [2020-10-19 20:24:40,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:40,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:40,709 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:40,711 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:40,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:40,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:24:40,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:24:40,749 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-19 20:24:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:40,763 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-10-19 20:24:40,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:24:40,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2020-10-19 20:24:40,766 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 20:24:40,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2020-10-19 20:24:40,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 20:24:40,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:24:40,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2020-10-19 20:24:40,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:40,768 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-10-19 20:24:40,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2020-10-19 20:24:40,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-10-19 20:24:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-19 20:24:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2020-10-19 20:24:40,771 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-10-19 20:24:40,771 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-10-19 20:24:40,771 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:24:40,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2020-10-19 20:24:40,772 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 20:24:40,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:40,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:40,773 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-19 20:24:40,773 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:40,773 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 221#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, 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; 218#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 219#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 220#L34-3 assume !(main_~i~1 < 5); 217#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, 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; 210#L20-3 [2020-10-19 20:24:40,774 INFO L796 eck$LassoCheckResult]: Loop: 210#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 211#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 210#L20-3 [2020-10-19 20:24:40,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:40,774 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-10-19 20:24:40,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:40,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091425054] [2020-10-19 20:24:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:40,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091425054] [2020-10-19 20:24:40,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608002620] [2020-10-19 20:24:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:40,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-19 20:24:40,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:40,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:40,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-19 20:24:40,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714607723] [2020-10-19 20:24:40,920 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:40,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:40,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2020-10-19 20:24:40,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:40,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230322966] [2020-10-19 20:24:40,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:40,936 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:40,941 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:40,943 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:40,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:40,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:24:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:24:40,980 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-10-19 20:24:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:41,006 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-10-19 20:24:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:24:41,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2020-10-19 20:24:41,010 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 20:24:41,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2020-10-19 20:24:41,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 20:24:41,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:24:41,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2020-10-19 20:24:41,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:41,016 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-10-19 20:24:41,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2020-10-19 20:24:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-10-19 20:24:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-19 20:24:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-10-19 20:24:41,023 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-10-19 20:24:41,023 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-10-19 20:24:41,023 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:24:41,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2020-10-19 20:24:41,024 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 20:24:41,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:41,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:41,027 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-19 20:24:41,027 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:41,027 INFO L794 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 286#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, 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; 282#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 283#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 284#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 285#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 292#L34-3 assume !(main_~i~1 < 5); 281#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, 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; 274#L20-3 [2020-10-19 20:24:41,027 INFO L796 eck$LassoCheckResult]: Loop: 274#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 275#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 274#L20-3 [2020-10-19 20:24:41,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:41,028 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-10-19 20:24:41,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:41,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449757809] [2020-10-19 20:24:41,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:41,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449757809] [2020-10-19 20:24:41,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840473191] [2020-10-19 20:24:41,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-19 20:24:41,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:24:41,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:41,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:41,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:41,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:41,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-19 20:24:41,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379629251] [2020-10-19 20:24:41,140 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2020-10-19 20:24:41,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:41,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603000668] [2020-10-19 20:24:41,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:41,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:41,150 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:41,152 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:41,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:41,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 20:24:41,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-19 20:24:41,183 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-10-19 20:24:41,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:41,203 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-10-19 20:24:41,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:24:41,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2020-10-19 20:24:41,205 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 20:24:41,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2020-10-19 20:24:41,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 20:24:41,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:24:41,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-10-19 20:24:41,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:41,206 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-10-19 20:24:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-10-19 20:24:41,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-10-19 20:24:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-19 20:24:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-10-19 20:24:41,209 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-10-19 20:24:41,210 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-10-19 20:24:41,210 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:24:41,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2020-10-19 20:24:41,211 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 20:24:41,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:41,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:41,211 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-10-19 20:24:41,212 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:41,212 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 357#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, 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; 358#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 359#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 360#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 361#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 369#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 368#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 367#L34-3 assume !(main_~i~1 < 5); 356#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, 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; 349#L20-3 [2020-10-19 20:24:41,212 INFO L796 eck$LassoCheckResult]: Loop: 349#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 350#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 349#L20-3 [2020-10-19 20:24:41,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:41,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-10-19 20:24:41,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:41,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634770692] [2020-10-19 20:24:41,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:41,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634770692] [2020-10-19 20:24:41,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935752621] [2020-10-19 20:24:41,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-19 20:24:41,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-19 20:24:41,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:41,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 20:24:41,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:41,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:41,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-19 20:24:41,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809915724] [2020-10-19 20:24:41,322 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:41,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:41,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2020-10-19 20:24:41,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:41,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703342050] [2020-10-19 20:24:41,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:41,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:41,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:41,333 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:41,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:41,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 20:24:41,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-19 20:24:41,361 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-10-19 20:24:41,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:41,384 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-10-19 20:24:41,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 20:24:41,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2020-10-19 20:24:41,386 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 20:24:41,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2020-10-19 20:24:41,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 20:24:41,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:24:41,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2020-10-19 20:24:41,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:41,388 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2020-10-19 20:24:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2020-10-19 20:24:41,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-10-19 20:24:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 20:24:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-10-19 20:24:41,391 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-10-19 20:24:41,391 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-10-19 20:24:41,391 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:24:41,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2020-10-19 20:24:41,392 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 20:24:41,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:41,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:41,393 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-10-19 20:24:41,393 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:41,394 INFO L794 eck$LassoCheckResult]: Stem: 448#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 443#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, 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; 444#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 445#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 446#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 447#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 449#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 457#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 456#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 455#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 454#L34-3 assume !(main_~i~1 < 5); 442#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, 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; 435#L20-3 [2020-10-19 20:24:41,394 INFO L796 eck$LassoCheckResult]: Loop: 435#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 436#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 435#L20-3 [2020-10-19 20:24:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:41,394 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-10-19 20:24:41,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:41,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125749228] [2020-10-19 20:24:41,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:41,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125749228] [2020-10-19 20:24:41,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704874429] [2020-10-19 20:24:41,461 INFO L93 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:41,500 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-19 20:24:41,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:41,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 20:24:41,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:41,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:41,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-19 20:24:41,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827177071] [2020-10-19 20:24:41,525 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:41,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:41,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2020-10-19 20:24:41,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:41,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311641633] [2020-10-19 20:24:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:41,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:41,534 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:41,536 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:41,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:41,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 20:24:41,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-19 20:24:41,564 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-10-19 20:24:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:41,587 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-10-19 20:24:41,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 20:24:41,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2020-10-19 20:24:41,589 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 20:24:41,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2020-10-19 20:24:41,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 20:24:41,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:24:41,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2020-10-19 20:24:41,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:41,591 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-10-19 20:24:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2020-10-19 20:24:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-19 20:24:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-19 20:24:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-10-19 20:24:41,594 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-10-19 20:24:41,594 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-10-19 20:24:41,594 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:24:41,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2020-10-19 20:24:41,595 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 20:24:41,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:41,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:41,596 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-10-19 20:24:41,596 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:41,596 INFO L794 eck$LassoCheckResult]: Stem: 545#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 543#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, 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; 539#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 540#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 541#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 542#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 544#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 555#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 554#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 553#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 552#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 551#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 550#L34-3 assume !(main_~i~1 < 5); 538#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, 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; 531#L20-3 [2020-10-19 20:24:41,596 INFO L796 eck$LassoCheckResult]: Loop: 531#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 532#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 531#L20-3 [2020-10-19 20:24:41,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:41,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-10-19 20:24:41,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:41,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591046099] [2020-10-19 20:24:41,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:41,614 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:41,628 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:41,634 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:41,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:41,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2020-10-19 20:24:41,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:41,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559893882] [2020-10-19 20:24:41,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:41,639 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:41,642 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:41,644 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:41,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:41,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2020-10-19 20:24:41,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:41,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543085380] [2020-10-19 20:24:41,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:41,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:41,684 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:41,689 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:43,044 WARN L193 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 167 DAG size of output: 127 [2020-10-19 20:24:43,240 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-19 20:24:43,243 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:24:43,243 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:24:43,243 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:24:43,243 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:24:43,244 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:24:43,244 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:43,244 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:24:43,244 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:24:43,244 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration7_Lasso [2020-10-19 20:24:43,245 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:24:43,245 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:24:43,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,503 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-10-19 20:24:43,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:43,931 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:24:43,932 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:43,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 [2020-10-19 20:24:43,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:43,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:43,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:43,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:43,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:43,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:43,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:43,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 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:43,985 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 [2020-10-19 20:24:43,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:43,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:43,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:43,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:43,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:43,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:43,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:43,989 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 [2020-10-19 20:24:44,013 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 [2020-10-19 20:24:44,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:44,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:44,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:44,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:44,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:44,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:44,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:44,016 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:44,044 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 [2020-10-19 20:24:44,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:44,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:44,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:44,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:44,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:44,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:44,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:44,051 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:44,079 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 [2020-10-19 20:24:44,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:44,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:44,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:44,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:44,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:44,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:44,087 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 [2020-10-19 20:24:44,111 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 [2020-10-19 20:24:44,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:44,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:44,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:44,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:44,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:44,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:44,124 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) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:44,150 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 [2020-10-19 20:24:44,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:44,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:44,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:44,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:44,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:44,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:44,174 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:24:44,200 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-19 20:24:44,200 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. 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) [2020-10-19 20:24:44,204 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:44,206 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:24:44,207 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:24:44,207 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sum_~x.base)_1, ULTIMATE.start_sum_~i~0) = 9*v_rep(select #length ULTIMATE.start_sum_~x.base)_1 - 8*ULTIMATE.start_sum_~i~0 Supporting invariants [] [2020-10-19 20:24:44,263 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-19 20:24:44,266 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:24:44,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:44,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:24:44,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:44,334 WARN L261 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 20:24:44,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:44,359 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 [2020-10-19 20:24:44,360 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-19 20:24:44,390 INFO L75 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. [2020-10-19 20:24:44,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:24:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:24:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-10-19 20:24:44,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2020-10-19 20:24:44,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:44,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 16 letters. Loop has 2 letters. [2020-10-19 20:24:44,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:44,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 4 letters. [2020-10-19 20:24:44,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:44,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2020-10-19 20:24:44,395 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-19 20:24:44,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2020-10-19 20:24:44,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-19 20:24:44,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-19 20:24:44,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2020-10-19 20:24:44,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:44,396 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-10-19 20:24:44,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2020-10-19 20:24:44,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-10-19 20:24:44,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-19 20:24:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-10-19 20:24:44,398 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-10-19 20:24:44,398 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-10-19 20:24:44,398 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:24:44,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2020-10-19 20:24:44,399 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-19 20:24:44,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:44,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:44,400 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:44,400 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:44,400 INFO L794 eck$LassoCheckResult]: Stem: 719#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 714#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, 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; 715#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 716#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 717#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 718#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 720#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 730#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 729#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 728#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 727#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 726#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 725#L34-3 assume !(main_~i~1 < 5); 713#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, 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; 705#L20-3 assume !(sum_~i~0 < 5); 703#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 704#L23 main_#t~ret7 := sum_#res;main_~ret~1 := 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;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;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~mem4, sum_#t~post3, 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; 723#L20-8 [2020-10-19 20:24:44,400 INFO L796 eck$LassoCheckResult]: Loop: 723#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 724#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 723#L20-8 [2020-10-19 20:24:44,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:44,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581027, now seen corresponding path program 1 times [2020-10-19 20:24:44,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:44,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994618999] [2020-10-19 20:24:44,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-19 20:24:44,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994618999] [2020-10-19 20:24:44,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:24:44,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:24:44,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199733914] [2020-10-19 20:24:44,433 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:44,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:44,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2020-10-19 20:24:44,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:44,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185043466] [2020-10-19 20:24:44,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:44,438 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:44,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:44,442 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:44,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:44,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:24:44,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:24:44,470 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-19 20:24:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:44,493 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-10-19 20:24:44,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:24:44,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2020-10-19 20:24:44,494 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-19 20:24:44,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2020-10-19 20:24:44,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-19 20:24:44,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-19 20:24:44,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2020-10-19 20:24:44,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:44,496 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-10-19 20:24:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2020-10-19 20:24:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2020-10-19 20:24:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-19 20:24:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-10-19 20:24:44,499 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-10-19 20:24:44,499 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-10-19 20:24:44,499 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:24:44,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2020-10-19 20:24:44,500 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-19 20:24:44,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:44,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:44,500 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:44,501 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:44,501 INFO L794 eck$LassoCheckResult]: Stem: 786#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 781#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, 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; 782#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 783#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 784#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 785#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 798#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 797#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 796#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 795#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 794#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 793#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 792#L34-3 assume !(main_~i~1 < 5); 780#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, 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; 772#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 773#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 774#L20-3 assume !(sum_~i~0 < 5); 770#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 771#L23 main_#t~ret7 := sum_#res;main_~ret~1 := 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;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;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~mem4, sum_#t~post3, 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; 789#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 790#L20-7 [2020-10-19 20:24:44,501 INFO L796 eck$LassoCheckResult]: Loop: 790#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 791#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 790#L20-7 [2020-10-19 20:24:44,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:44,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1577614809, now seen corresponding path program 1 times [2020-10-19 20:24:44,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:44,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644897039] [2020-10-19 20:24:44,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-19 20:24:44,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644897039] [2020-10-19 20:24:44,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603800558] [2020-10-19 20:24:44,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:24:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:44,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-19 20:24:44,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-19 20:24:44,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:44,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-19 20:24:44,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324783575] [2020-10-19 20:24:44,609 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:44,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2020-10-19 20:24:44,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:44,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064755296] [2020-10-19 20:24:44,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:44,614 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:44,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:44,617 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:44,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:44,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:24:44,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:24:44,644 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-10-19 20:24:44,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:44,682 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-10-19 20:24:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:24:44,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2020-10-19 20:24:44,683 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-19 20:24:44,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 43 transitions. [2020-10-19 20:24:44,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-19 20:24:44,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-19 20:24:44,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2020-10-19 20:24:44,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:44,685 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-10-19 20:24:44,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2020-10-19 20:24:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2020-10-19 20:24:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-19 20:24:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-10-19 20:24:44,687 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-10-19 20:24:44,687 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-10-19 20:24:44,687 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 20:24:44,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2020-10-19 20:24:44,688 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-19 20:24:44,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:44,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:44,689 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:44,689 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:44,689 INFO L794 eck$LassoCheckResult]: Stem: 920#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 915#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, 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; 916#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 917#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 918#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 919#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 935#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 934#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 933#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 932#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 931#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 930#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 929#L34-3 assume !(main_~i~1 < 5); 914#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, 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; 905#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 906#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 907#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 908#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 927#L20-3 assume !(sum_~i~0 < 5); 903#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 904#L23 main_#t~ret7 := sum_#res;main_~ret~1 := 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;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;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~mem4, sum_#t~post3, 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; 925#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 926#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 923#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 924#L20-7 [2020-10-19 20:24:44,689 INFO L796 eck$LassoCheckResult]: Loop: 924#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 928#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 924#L20-7 [2020-10-19 20:24:44,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:44,690 INFO L82 PathProgramCache]: Analyzing trace with hash -483964569, now seen corresponding path program 1 times [2020-10-19 20:24:44,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:44,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651715940] [2020-10-19 20:24:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-19 20:24:44,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651715940] [2020-10-19 20:24:44,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932691503] [2020-10-19 20:24:44,731 INFO L95 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 [2020-10-19 20:24:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:44,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:44,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-19 20:24:44,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:44,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-19 20:24:44,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432272653] [2020-10-19 20:24:44,810 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:44,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2020-10-19 20:24:44,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:44,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420081457] [2020-10-19 20:24:44,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:44,814 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:44,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:44,817 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:44,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:44,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 20:24:44,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-19 20:24:44,844 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-10-19 20:24:44,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:44,901 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-10-19 20:24:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:24:44,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 49 transitions. [2020-10-19 20:24:44,903 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-19 20:24:44,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 49 transitions. [2020-10-19 20:24:44,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-19 20:24:44,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-19 20:24:44,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 49 transitions. [2020-10-19 20:24:44,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:44,905 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-10-19 20:24:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 49 transitions. [2020-10-19 20:24:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2020-10-19 20:24:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-19 20:24:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-10-19 20:24:44,908 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-10-19 20:24:44,908 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-10-19 20:24:44,908 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 20:24:44,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2020-10-19 20:24:44,908 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-19 20:24:44,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:44,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:44,909 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:44,909 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:44,910 INFO L794 eck$LassoCheckResult]: Stem: 1077#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1076#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, 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; 1072#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1073#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1074#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1075#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1093#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1092#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1091#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1090#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1089#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1088#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1087#L34-3 assume !(main_~i~1 < 5); 1071#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, 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; 1061#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1062#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1068#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1095#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1063#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1064#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1084#L20-3 assume !(sum_~i~0 < 5); 1059#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1060#L23 main_#t~ret7 := sum_#res;main_~ret~1 := 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;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;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~mem4, sum_#t~post3, 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; 1082#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1083#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1080#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1081#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1094#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1086#L20-7 [2020-10-19 20:24:44,910 INFO L796 eck$LassoCheckResult]: Loop: 1086#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1085#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1086#L20-7 [2020-10-19 20:24:44,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:44,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1757450151, now seen corresponding path program 2 times [2020-10-19 20:24:44,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:44,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852542159] [2020-10-19 20:24:44,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-10-19 20:24:44,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852542159] [2020-10-19 20:24:44,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880812783] [2020-10-19 20:24:44,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-19 20:24:45,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:24:45,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:45,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 20:24:45,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-10-19 20:24:45,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:45,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-19 20:24:45,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764150795] [2020-10-19 20:24:45,039 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2020-10-19 20:24:45,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:45,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680337173] [2020-10-19 20:24:45,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:45,043 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:45,046 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:45,048 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:45,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:45,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 20:24:45,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-19 20:24:45,077 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-10-19 20:24:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:45,155 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2020-10-19 20:24:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 20:24:45,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2020-10-19 20:24:45,157 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-19 20:24:45,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 55 transitions. [2020-10-19 20:24:45,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-10-19 20:24:45,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-10-19 20:24:45,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 55 transitions. [2020-10-19 20:24:45,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:45,159 INFO L691 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-10-19 20:24:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 55 transitions. [2020-10-19 20:24:45,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2020-10-19 20:24:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-19 20:24:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-10-19 20:24:45,162 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-10-19 20:24:45,163 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-10-19 20:24:45,163 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 20:24:45,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2020-10-19 20:24:45,163 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-19 20:24:45,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:45,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:45,165 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:45,165 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:45,165 INFO L794 eck$LassoCheckResult]: Stem: 1255#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1250#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, 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; 1251#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1252#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1253#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1254#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1272#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1271#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1270#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1269#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1268#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1267#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1266#L34-3 assume !(main_~i~1 < 5); 1249#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, 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; 1240#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1241#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1242#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1243#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1275#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1274#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1273#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1263#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1262#L20-3 assume !(sum_~i~0 < 5); 1238#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1239#L23 main_#t~ret7 := sum_#res;main_~ret~1 := 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;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;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~mem4, sum_#t~post3, 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; 1260#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1261#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1258#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1259#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1278#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1277#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1276#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1265#L20-7 [2020-10-19 20:24:45,166 INFO L796 eck$LassoCheckResult]: Loop: 1265#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1264#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1265#L20-7 [2020-10-19 20:24:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:45,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1218450663, now seen corresponding path program 3 times [2020-10-19 20:24:45,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:45,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528024046] [2020-10-19 20:24:45,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-10-19 20:24:45,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528024046] [2020-10-19 20:24:45,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698985050] [2020-10-19 20:24:45,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-19 20:24:45,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-19 20:24:45,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:45,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 20:24:45,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-10-19 20:24:45,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:45,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-19 20:24:45,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009603514] [2020-10-19 20:24:45,319 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:45,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:45,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2020-10-19 20:24:45,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:45,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697273678] [2020-10-19 20:24:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:45,323 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:45,325 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:45,327 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:45,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:45,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 20:24:45,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-19 20:24:45,356 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-10-19 20:24:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:45,431 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-10-19 20:24:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 20:24:45,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 58 transitions. [2020-10-19 20:24:45,432 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-19 20:24:45,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 58 transitions. [2020-10-19 20:24:45,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-10-19 20:24:45,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-10-19 20:24:45,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions. [2020-10-19 20:24:45,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:45,434 INFO L691 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-10-19 20:24:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions. [2020-10-19 20:24:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2020-10-19 20:24:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-19 20:24:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-10-19 20:24:45,437 INFO L714 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-10-19 20:24:45,438 INFO L594 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-10-19 20:24:45,438 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 20:24:45,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 49 transitions. [2020-10-19 20:24:45,438 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-19 20:24:45,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:45,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:45,440 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:45,440 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:45,440 INFO L794 eck$LassoCheckResult]: Stem: 1454#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1449#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, 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; 1450#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1451#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1452#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1453#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1475#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1473#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1471#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1469#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1467#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1465#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1464#L34-3 assume !(main_~i~1 < 5); 1448#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, 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; 1439#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1440#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1441#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1442#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1481#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1480#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1479#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1478#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1477#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1461#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1460#L20-3 assume !(sum_~i~0 < 5); 1437#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1438#L23 main_#t~ret7 := sum_#res;main_~ret~1 := 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;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;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~mem4, sum_#t~post3, 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; 1457#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1458#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1459#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1476#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1474#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1472#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1470#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1468#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1466#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1463#L20-7 [2020-10-19 20:24:45,441 INFO L796 eck$LassoCheckResult]: Loop: 1463#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1462#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1463#L20-7 [2020-10-19 20:24:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:45,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2144167641, now seen corresponding path program 4 times [2020-10-19 20:24:45,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:45,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936730922] [2020-10-19 20:24:45,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:45,527 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:45,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:45,639 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:45,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:45,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2020-10-19 20:24:45,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:45,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40671506] [2020-10-19 20:24:45,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:45,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:45,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:45,651 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:45,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:45,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1039200421, now seen corresponding path program 5 times [2020-10-19 20:24:45,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:45,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850960178] [2020-10-19 20:24:45,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-10-19 20:24:45,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850960178] [2020-10-19 20:24:45,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527844161] [2020-10-19 20:24:45,741 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2020-10-19 20:24:45,817 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-19 20:24:45,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:45,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 20:24:45,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-10-19 20:24:45,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 20:24:45,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2020-10-19 20:24:45,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119204928] [2020-10-19 20:24:45,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:45,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 20:24:45,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-10-19 20:24:45,877 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-10-19 20:24:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:45,969 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-10-19 20:24:45,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 20:24:45,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2020-10-19 20:24:45,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 20:24:45,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 43 transitions. [2020-10-19 20:24:45,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-19 20:24:45,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-10-19 20:24:45,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 43 transitions. [2020-10-19 20:24:45,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:45,971 INFO L691 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-19 20:24:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 43 transitions. [2020-10-19 20:24:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-19 20:24:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-19 20:24:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-10-19 20:24:45,974 INFO L714 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-19 20:24:45,974 INFO L594 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-19 20:24:45,974 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-19 20:24:45,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 43 transitions. [2020-10-19 20:24:45,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 20:24:45,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:45,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:45,976 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:45,976 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:45,977 INFO L794 eck$LassoCheckResult]: Stem: 1674#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1669#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, 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; 1670#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1671#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1672#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1673#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1695#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1694#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1692#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1690#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1688#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1685#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1684#L34-3 assume !(main_~i~1 < 5); 1668#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, 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; 1663#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1664#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1665#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1693#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1691#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1689#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1687#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1686#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1683#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1682#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1681#L20-3 assume !(sum_~i~0 < 5); 1661#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1662#L23 main_#t~ret7 := sum_#res;main_~ret~1 := 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;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;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~mem4, sum_#t~post3, 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; 1679#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1680#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1677#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1678#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1702#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1701#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1700#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1699#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1698#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1697#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1696#L20-8 assume !(sum_~i~0 < 5); 1675#L20-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1676#L23-1 main_#t~ret10 := sum_#res;main_~ret2~0 := main_#t~ret10;havoc main_#t~ret10;call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~2 := 0; 1666#L43-3 [2020-10-19 20:24:45,977 INFO L796 eck$LassoCheckResult]: Loop: 1666#L43-3 assume !!(main_~i~2 < 4);call main_#t~mem13 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem13, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem13; 1667#L43-2 main_#t~post12 := main_~i~2;main_~i~2 := 1 + main_#t~post12;havoc main_#t~post12; 1666#L43-3 [2020-10-19 20:24:45,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:45,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2055775835, now seen corresponding path program 1 times [2020-10-19 20:24:45,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:45,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596652633] [2020-10-19 20:24:45,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:46,048 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:46,109 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:46,136 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:46,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:46,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2020-10-19 20:24:46,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:46,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942727259] [2020-10-19 20:24:46,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:46,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:46,142 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:46,143 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:46,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:46,144 INFO L82 PathProgramCache]: Analyzing trace with hash 84380519, now seen corresponding path program 1 times [2020-10-19 20:24:46,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:46,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048154161] [2020-10-19 20:24:46,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:46,185 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:46,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:46,221 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:05,214 WARN L193 SmtUtils]: Spent 18.94 s on a formula simplification. DAG size of input: 383 DAG size of output: 278 [2020-10-19 20:25:05,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 20:25:05,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 20:25:05,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 20:25:13,283 WARN L193 SmtUtils]: Spent 7.84 s on a formula simplification. DAG size of input: 283 DAG size of output: 201 [2020-10-19 20:25:13,290 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:13,290 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:13,290 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:13,290 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:13,290 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:13,291 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:13,291 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:13,291 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:13,291 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration14_Lasso [2020-10-19 20:25:13,291 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:13,291 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:13,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:13,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:13,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:13,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:13,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:19,323 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2020-10-19 20:25:20,328 WARN L193 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 116 [2020-10-19 20:25:20,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:20,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:20,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:20,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:20,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:20,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:20,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:20,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:20,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:20,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:20,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:20,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:20,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:21,823 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 163 DAG size of output: 135 [2020-10-19 20:25:21,920 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2020-10-19 20:25:23,885 WARN L193 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 130 DAG size of output: 123 [2020-10-19 20:25:23,986 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:23,986 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) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:23,993 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 [2020-10-19 20:25:23,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:23,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:23,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:23,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:23,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:23,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:23,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:23,999 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) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:24,025 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 [2020-10-19 20:25:24,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:24,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:24,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:24,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:24,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:24,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:24,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:24,029 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) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:24,051 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 [2020-10-19 20:25:24,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:24,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:24,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:24,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:24,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:24,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:24,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:24,054 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 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 [2020-10-19 20:25:24,078 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 [2020-10-19 20:25:24,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:24,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:24,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:24,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:24,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:24,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:24,084 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) [2020-10-19 20:25:24,129 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 [2020-10-19 20:25:24,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:24,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:24,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:24,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:24,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:24,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:24,142 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) [2020-10-19 20:25:24,181 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 [2020-10-19 20:25:24,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:24,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:24,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:24,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:24,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:24,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:24,185 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 [2020-10-19 20:25:24,189 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) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:24,214 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 [2020-10-19 20:25:24,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:24,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:24,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:24,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:24,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:24,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:24,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:24,217 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) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:24,241 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 [2020-10-19 20:25:24,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:24,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:24,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:24,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:24,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:24,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:24,254 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) [2020-10-19 20:25:24,280 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 [2020-10-19 20:25:24,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:24,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:24,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:24,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:24,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:24,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:24,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:24,285 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 [2020-10-19 20:25:24,321 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 [2020-10-19 20:25:24,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:24,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:24,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:24,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:24,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:24,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:24,327 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) [2020-10-19 20:25:24,350 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:24,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:24,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:24,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:24,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:24,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:24,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:24,356 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) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:24,380 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 [2020-10-19 20:25:24,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:24,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:24,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:24,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:24,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:24,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:24,387 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 [2020-10-19 20:25:24,413 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 [2020-10-19 20:25:24,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:24,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:24,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:24,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:24,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:24,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:24,420 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) [2020-10-19 20:25:24,445 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:24,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:24,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:24,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:24,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:24,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:24,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:24,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:24,449 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) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:24,473 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 [2020-10-19 20:25:24,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:24,475 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-19 20:25:24,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:24,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:24,496 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-19 20:25:24,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:24,534 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:25:24,633 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-10-19 20:25:24,633 INFO L444 ModelExtractionUtils]: 34 out of 67 variables were initially zero. Simplification set additionally 30 variables to zero. 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) [2020-10-19 20:25:24,636 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:24,638 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:25:24,638 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:25:24,638 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2020-10-19 20:25:25,130 INFO L297 tatePredicateManager]: 48 out of 48 supporting invariants were superfluous and have been removed [2020-10-19 20:25:25,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:25,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:25:25,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:25,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:25:25,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:25,244 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 [2020-10-19 20:25:25,244 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-10-19 20:25:25,259 INFO L75 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. [2020-10-19 20:25:25,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 20:25:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:25:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-10-19 20:25:25,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 2 letters. [2020-10-19 20:25:25,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:25,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 42 letters. Loop has 2 letters. [2020-10-19 20:25:25,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:25,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 4 letters. [2020-10-19 20:25:25,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:25,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2020-10-19 20:25:25,264 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:25:25,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2020-10-19 20:25:25,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 20:25:25,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 20:25:25,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 20:25:25,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:25,264 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:25:25,265 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:25:25,265 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:25:25,265 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-19 20:25:25,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 20:25:25,265 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:25:25,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 20:25:25,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 08:25:25 BoogieIcfgContainer [2020-10-19 20:25:25,273 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 20:25:25,275 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 20:25:25,275 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 20:25:25,276 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 20:25:25,276 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:24:37" (3/4) ... [2020-10-19 20:25:25,280 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 20:25:25,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 20:25:25,291 INFO L168 Benchmark]: Toolchain (without parser) took 48504.59 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 371.2 MB). Free memory was 958.6 MB in the beginning and 1.0 GB in the end (delta: -50.6 MB). Peak memory consumption was 320.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:25,292 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:25:25,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 958.6 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:25,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:25:25,295 INFO L168 Benchmark]: Boogie Preprocessor took 37.06 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. [2020-10-19 20:25:25,296 INFO L168 Benchmark]: RCFGBuilder took 400.07 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:25,296 INFO L168 Benchmark]: BuchiAutomizer took 47539.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.0 MB). Peak memory consumption was 325.0 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:25,297 INFO L168 Benchmark]: Witness Printer took 5.70 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:25:25,300 INFO L339 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 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 461.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 958.6 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.06 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 400.07 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 47539.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.0 MB). Peak memory consumption was 325.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.70 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i 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 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 47.4s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 46.1s. 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: 233 SDtfs, 164 SDslu, 421 SDs, 0 SdLazy, 316 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital638 mio100 ax100 hnf99 lsp238 ukn40 mio100 lsp91 div97 bol100 ite100 ukn100 eq161 hnf88 smp85 dnf231 smp74 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 167ms VariablesStem: 41 VariablesLoop: 11 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...