./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/max10-1.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 26bc4a4da598eefeae13591143340a28d87c3535 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 06:00:42,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 06:00:42,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 06:00:42,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 06:00:42,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 06:00:42,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 06:00:42,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 06:00:42,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 06:00:42,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 06:00:42,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 06:00:42,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 06:00:42,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 06:00:42,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 06:00:42,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 06:00:42,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 06:00:42,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 06:00:42,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 06:00:42,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 06:00:42,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 06:00:42,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 06:00:42,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 06:00:42,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 06:00:42,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 06:00:42,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 06:00:42,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 06:00:42,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 06:00:42,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 06:00:42,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 06:00:42,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 06:00:42,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 06:00:42,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 06:00:42,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 06:00:42,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 06:00:42,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 06:00:42,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 06:00:42,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 06:00:42,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 06:00:42,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 06:00:42,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 06:00:42,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 06:00:42,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 06:00:42,671 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 06:00:42,709 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 06:00:42,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 06:00:42,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 06:00:42,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 06:00:42,713 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 06:00:42,713 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 06:00:42,713 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 06:00:42,714 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 06:00:42,714 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 06:00:42,714 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 06:00:42,715 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 06:00:42,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 06:00:42,715 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 06:00:42,716 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 06:00:42,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 06:00:42,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 06:00:42,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 06:00:42,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 06:00:42,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 06:00:42,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 06:00:42,718 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 06:00:42,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 06:00:42,719 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 06:00:42,719 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 06:00:42,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 06:00:42,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 06:00:42,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 06:00:42,720 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 06:00:42,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 06:00:42,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 06:00:42,721 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 06:00:42,722 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 06:00:42,723 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 06:00:42,724 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 26bc4a4da598eefeae13591143340a28d87c3535 [2020-10-26 06:00:43,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 06:00:43,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 06:00:43,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 06:00:43,266 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 06:00:43,267 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 06:00:43,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max10-1.i [2020-10-26 06:00:43,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/532ca8ff0/137d0a3965e24c539a011e7f0f5e1856/FLAG114a04a8d [2020-10-26 06:00:44,040 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 06:00:44,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i [2020-10-26 06:00:44,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/532ca8ff0/137d0a3965e24c539a011e7f0f5e1856/FLAG114a04a8d [2020-10-26 06:00:44,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/532ca8ff0/137d0a3965e24c539a011e7f0f5e1856 [2020-10-26 06:00:44,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 06:00:44,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 06:00:44,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 06:00:44,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 06:00:44,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 06:00:44,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:00:44" (1/1) ... [2020-10-26 06:00:44,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74a5151f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:44, skipping insertion in model container [2020-10-26 06:00:44,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:00:44" (1/1) ... [2020-10-26 06:00:44,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 06:00:44,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 06:00:44,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 06:00:44,694 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 06:00:44,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 06:00:44,761 INFO L208 MainTranslator]: Completed translation [2020-10-26 06:00:44,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:44 WrapperNode [2020-10-26 06:00:44,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 06:00:44,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 06:00:44,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 06:00:44,765 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 06:00:44,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:44" (1/1) ... [2020-10-26 06:00:44,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:44" (1/1) ... [2020-10-26 06:00:44,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 06:00:44,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 06:00:44,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 06:00:44,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 06:00:44,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:44" (1/1) ... [2020-10-26 06:00:44,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:44" (1/1) ... [2020-10-26 06:00:44,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:44" (1/1) ... [2020-10-26 06:00:44,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:44" (1/1) ... [2020-10-26 06:00:44,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:44" (1/1) ... [2020-10-26 06:00:44,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:44" (1/1) ... [2020-10-26 06:00:44,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:44" (1/1) ... [2020-10-26 06:00:44,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 06:00:44,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 06:00:44,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 06:00:44,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 06:00:44,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:44" (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-26 06:00:45,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 06:00:45,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 06:00:45,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 06:00:45,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 06:00:45,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 06:00:45,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 06:00:45,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 06:00:45,525 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 06:00:45,526 INFO L298 CfgBuilder]: Removed 17 assume(true) statements. [2020-10-26 06:00:45,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:00:45 BoogieIcfgContainer [2020-10-26 06:00:45,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 06:00:45,530 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 06:00:45,530 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 06:00:45,535 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 06:00:45,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:00:45,536 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 06:00:44" (1/3) ... [2020-10-26 06:00:45,539 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c4bef48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 06:00:45, skipping insertion in model container [2020-10-26 06:00:45,539 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:00:45,539 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:44" (2/3) ... [2020-10-26 06:00:45,540 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c4bef48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 06:00:45, skipping insertion in model container [2020-10-26 06:00:45,540 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:00:45,540 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:00:45" (3/3) ... [2020-10-26 06:00:45,542 INFO L373 chiAutomizerObserver]: Analyzing ICFG max10-1.i [2020-10-26 06:00:45,612 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 06:00:45,612 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 06:00:45,613 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 06:00:45,613 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 06:00:45,613 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 06:00:45,613 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 06:00:45,613 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 06:00:45,614 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 06:00:45,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-10-26 06:00:45,657 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-10-26 06:00:45,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:45,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:45,666 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 06:00:45,667 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:00:45,667 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 06:00:45,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-10-26 06:00:45,671 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-10-26 06:00:45,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:45,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:45,672 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 06:00:45,672 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:00:45,682 INFO L794 eck$LassoCheckResult]: Stem: 33#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~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);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-26 06:00:45,683 INFO L796 eck$LassoCheckResult]: Loop: 9#L34-3true assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 12#L34-2true main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 9#L34-3true [2020-10-26 06:00:45,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:45,691 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-26 06:00:45,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:45,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328436863] [2020-10-26 06:00:45,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:45,848 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:45,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:45,907 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:45,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:45,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-26 06:00:45,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:45,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164309611] [2020-10-26 06:00:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:45,944 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:45,960 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:45,967 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:45,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:45,970 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-26 06:00:45,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:45,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541743218] [2020-10-26 06:00:45,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:46,022 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:46,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:46,071 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:46,552 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-10-26 06:00:46,702 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-26 06:00:46,718 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:00:46,719 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:00:46,720 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:00:46,720 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:00:46,720 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:00:46,721 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:46,721 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:00:46,721 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:00:46,721 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration1_Lasso [2020-10-26 06:00:46,722 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:00:46,722 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:00:46,750 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-26 06:00:46,760 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-26 06:00:46,767 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-26 06:00:46,774 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-26 06:00:46,783 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-26 06:00:46,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-26 06:00:46,796 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-26 06:00:46,803 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-26 06:00:46,811 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-26 06:00:46,817 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-26 06:00:46,825 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-26 06:00:46,831 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-26 06:00:46,838 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-26 06:00:46,844 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-26 06:00:46,850 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-26 06:00:46,857 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-26 06:00:46,863 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-26 06:00:47,157 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-10-26 06:00:47,207 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-26 06:00:47,218 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-26 06:00:47,729 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:00:47,735 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-26 06:00:47,750 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-26 06:00:47,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:47,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:47,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:47,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:47,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:47,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:47,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:47,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 2 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:47,802 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-26 06:00:47,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:47,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:47,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:47,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:47,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:47,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:47,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:47,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:47,848 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-26 06:00:47,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:47,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:47,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:47,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:47,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:47,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:47,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:47,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:47,896 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-26 06:00:47,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:47,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:47,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:47,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:47,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:47,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:47,908 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-26 06:00:47,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-26 06:00:47,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:47,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:47,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:47,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:47,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:47,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:47,956 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-26 06:00:47,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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:47,992 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-26 06:00:47,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:47,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:47,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:47,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:47,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:47,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:47,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:48,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:48,035 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-26 06:00:48,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:48,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:48,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:48,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:48,073 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-26 06:00:48,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:48,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:48,085 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-26 06:00:48,113 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-26 06:00:48,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:48,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:48,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:48,119 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-26 06:00:48,145 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-26 06:00:48,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:48,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:48,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:48,202 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-26 06:00:48,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:48,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:48,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:48,208 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-26 06:00:48,239 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-26 06:00:48,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:48,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:48,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:48,247 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-26 06:00:48,297 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-26 06:00:48,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:48,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:48,301 INFO L402 nArgumentSynthesizer]: A total of 0 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-26 06:00:48,304 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-26 06:00:48,339 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-26 06:00:48,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:48,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:48,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:48,345 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-26 06:00:48,375 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-26 06:00:48,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:48,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:48,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:48,381 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-26 06:00:48,412 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-26 06:00:48,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:48,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:48,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:48,427 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-26 06:00:48,466 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-26 06:00:48,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:48,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:48,479 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-26 06:00:48,507 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-26 06:00:48,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:48,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:48,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:48,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 06:00:48,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:48,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:48,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:48,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:48,599 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-26 06:00:48,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:48,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:48,614 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:48,658 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-26 06:00:48,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:48,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:48,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:48,713 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-26 06:00:48,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:48,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:48,725 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:48,765 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-26 06:00:48,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:48,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:48,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:48,772 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:48,832 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-26 06:00:48,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:48,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:48,845 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:48,888 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-26 06:00:48,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:48,895 INFO L402 nArgumentSynthesizer]: A total of 2 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-26 06:00:48,901 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) [2020-10-26 06:00:48,944 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-26 06:00:48,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:48,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:48,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:48,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:48,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:48,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:48,969 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:00:49,012 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-26 06:00:49,012 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:49,019 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:49,024 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:00:49,025 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:00:49,026 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2020-10-26 06:00:49,116 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-26 06:00:49,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 06:00:49,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:49,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 06:00:49,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:49,284 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 06:00:49,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:49,333 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-26 06:00:49,354 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-26 06:00:49,355 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states. Second operand 3 states. [2020-10-26 06:00:49,554 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states.. Second operand 3 states. Result 87 states and 124 transitions. Complement of second has 8 states. [2020-10-26 06:00:49,556 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-26 06:00:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 06:00:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2020-10-26 06:00:49,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-26 06:00:49,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:49,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-26 06:00:49,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:49,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-26 06:00:49,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:49,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 124 transitions. [2020-10-26 06:00:49,585 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:49,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 25 states and 33 transitions. [2020-10-26 06:00:49,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-26 06:00:49,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:49,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2020-10-26 06:00:49,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:49,604 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-26 06:00:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2020-10-26 06:00:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-26 06:00:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-26 06:00:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-10-26 06:00:49,646 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-26 06:00:49,647 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-26 06:00:49,647 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 06:00:49,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2020-10-26 06:00:49,649 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:49,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:49,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:49,650 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 06:00:49,651 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:49,652 INFO L794 eck$LassoCheckResult]: Stem: 208#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); 204#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 205#L34-3 assume !(main_~i~1 < 10); 203#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 193#L20-3 [2020-10-26 06:00:49,653 INFO L796 eck$LassoCheckResult]: Loop: 193#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 194#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 202#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 198#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 193#L20-3 [2020-10-26 06:00:49,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:49,654 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-10-26 06:00:49,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:49,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063794986] [2020-10-26 06:00:49,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:49,728 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-26 06:00:49,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063794986] [2020-10-26 06:00:49,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:00:49,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 06:00:49,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982094554] [2020-10-26 06:00:49,735 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:49,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:49,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2020-10-26 06:00:49,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:49,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148868120] [2020-10-26 06:00:49,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:49,745 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:49,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:49,761 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:49,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:49,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 06:00:49,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 06:00:49,846 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-26 06:00:49,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:49,869 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-10-26 06:00:49,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 06:00:49,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2020-10-26 06:00:49,877 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:49,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2020-10-26 06:00:49,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:49,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:49,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2020-10-26 06:00:49,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:49,881 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-10-26 06:00:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2020-10-26 06:00:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-10-26 06:00:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-26 06:00:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-26 06:00:49,891 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-26 06:00:49,891 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-26 06:00:49,892 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 06:00:49,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2020-10-26 06:00:49,893 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:49,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:49,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:49,896 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-26 06:00:49,896 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:49,897 INFO L794 eck$LassoCheckResult]: Stem: 265#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); 261#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 262#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 263#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 264#L34-3 assume !(main_~i~1 < 10); 260#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 250#L20-3 [2020-10-26 06:00:49,897 INFO L796 eck$LassoCheckResult]: Loop: 250#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 251#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 259#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 254#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 250#L20-3 [2020-10-26 06:00:49,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:49,898 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-10-26 06:00:49,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:49,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210744741] [2020-10-26 06:00:49,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:49,973 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-26 06:00:49,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210744741] [2020-10-26 06:00:49,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350745960] [2020-10-26 06:00:49,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:00:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:50,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-26 06:00:50,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:50,069 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-26 06:00:50,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:50,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-26 06:00:50,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496693303] [2020-10-26 06:00:50,070 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:50,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2020-10-26 06:00:50,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:50,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764774727] [2020-10-26 06:00:50,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:50,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:50,093 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:50,098 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:50,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:50,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 06:00:50,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 06:00:50,150 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-26 06:00:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:50,190 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-10-26 06:00:50,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 06:00:50,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2020-10-26 06:00:50,192 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:50,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2020-10-26 06:00:50,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:50,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:50,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2020-10-26 06:00:50,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:50,197 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-10-26 06:00:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2020-10-26 06:00:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-26 06:00:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-26 06:00:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-10-26 06:00:50,206 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-26 06:00:50,207 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-26 06:00:50,207 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 06:00:50,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2020-10-26 06:00:50,208 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:50,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:50,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:50,214 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-26 06:00:50,214 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:50,215 INFO L794 eck$LassoCheckResult]: Stem: 342#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); 337#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 338#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 339#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 340#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 341#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 346#L34-3 assume !(main_~i~1 < 10); 336#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 326#L20-3 [2020-10-26 06:00:50,215 INFO L796 eck$LassoCheckResult]: Loop: 326#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 327#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 335#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 330#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 326#L20-3 [2020-10-26 06:00:50,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:50,216 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-10-26 06:00:50,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:50,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957851576] [2020-10-26 06:00:50,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:50,278 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-26 06:00:50,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957851576] [2020-10-26 06:00:50,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884313722] [2020-10-26 06:00:50,279 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:00:50,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 06:00:50,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:00:50,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:00:50,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:50,341 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-26 06:00:50,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:50,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-26 06:00:50,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121559264] [2020-10-26 06:00:50,342 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:50,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:50,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2020-10-26 06:00:50,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:50,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427123595] [2020-10-26 06:00:50,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:50,350 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:50,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:50,358 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:50,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:50,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 06:00:50,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-26 06:00:50,408 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2020-10-26 06:00:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:50,431 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-10-26 06:00:50,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 06:00:50,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2020-10-26 06:00:50,433 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:50,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2020-10-26 06:00:50,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:50,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:50,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2020-10-26 06:00:50,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:50,435 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-10-26 06:00:50,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2020-10-26 06:00:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-10-26 06:00:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-26 06:00:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-10-26 06:00:50,439 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-26 06:00:50,439 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-26 06:00:50,439 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 06:00:50,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2020-10-26 06:00:50,440 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:50,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:50,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:50,441 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-10-26 06:00:50,441 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:50,442 INFO L794 eck$LassoCheckResult]: Stem: 430#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); 428#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 424#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 425#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 426#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 427#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 429#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 435#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 434#L34-3 assume !(main_~i~1 < 10); 423#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 413#L20-3 [2020-10-26 06:00:50,442 INFO L796 eck$LassoCheckResult]: Loop: 413#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 414#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 422#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 417#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 413#L20-3 [2020-10-26 06:00:50,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:50,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-10-26 06:00:50,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:50,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755037427] [2020-10-26 06:00:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:50,507 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-26 06:00:50,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755037427] [2020-10-26 06:00:50,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58652062] [2020-10-26 06:00:50,508 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:00:50,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-26 06:00:50,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:00:50,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 06:00:50,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:50,589 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-26 06:00:50,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:50,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-26 06:00:50,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882471613] [2020-10-26 06:00:50,590 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:50,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2020-10-26 06:00:50,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:50,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587503628] [2020-10-26 06:00:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:50,602 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:50,618 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:50,621 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:50,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:50,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 06:00:50,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-26 06:00:50,672 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-10-26 06:00:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:50,714 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-10-26 06:00:50,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 06:00:50,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2020-10-26 06:00:50,717 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:50,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2020-10-26 06:00:50,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:50,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:50,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2020-10-26 06:00:50,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:50,718 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-10-26 06:00:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2020-10-26 06:00:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-10-26 06:00:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-26 06:00:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2020-10-26 06:00:50,722 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-10-26 06:00:50,722 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-10-26 06:00:50,722 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 06:00:50,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2020-10-26 06:00:50,723 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:50,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:50,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:50,724 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-10-26 06:00:50,724 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:50,725 INFO L794 eck$LassoCheckResult]: Stem: 527#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); 522#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 523#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 524#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 525#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 526#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 528#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 535#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 534#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 533#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 532#L34-3 assume !(main_~i~1 < 10); 521#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 511#L20-3 [2020-10-26 06:00:50,725 INFO L796 eck$LassoCheckResult]: Loop: 511#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 512#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 520#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 515#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 511#L20-3 [2020-10-26 06:00:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:50,726 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-10-26 06:00:50,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:50,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655523767] [2020-10-26 06:00:50,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:50,834 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-26 06:00:50,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655523767] [2020-10-26 06:00:50,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941790870] [2020-10-26 06:00:50,835 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:00:50,892 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-26 06:00:50,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:00:50,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 06:00:50,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:50,936 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-26 06:00:50,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:50,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-26 06:00:50,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355958840] [2020-10-26 06:00:50,937 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:50,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2020-10-26 06:00:50,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:50,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022683293] [2020-10-26 06:00:50,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:50,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:50,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:50,949 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:50,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:50,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 06:00:50,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-26 06:00:50,992 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-10-26 06:00:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:51,022 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2020-10-26 06:00:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 06:00:51,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2020-10-26 06:00:51,023 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:51,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2020-10-26 06:00:51,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:51,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:51,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2020-10-26 06:00:51,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:51,025 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-10-26 06:00:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2020-10-26 06:00:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-10-26 06:00:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-26 06:00:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2020-10-26 06:00:51,035 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-26 06:00:51,035 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-26 06:00:51,036 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 06:00:51,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2020-10-26 06:00:51,037 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:51,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:51,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:51,038 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-10-26 06:00:51,038 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:51,038 INFO L794 eck$LassoCheckResult]: Stem: 636#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); 631#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 632#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 633#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 634#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 635#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 637#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 646#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 645#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 644#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 643#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 642#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 641#L34-3 assume !(main_~i~1 < 10); 630#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 620#L20-3 [2020-10-26 06:00:51,038 INFO L796 eck$LassoCheckResult]: Loop: 620#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 621#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 629#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 624#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 620#L20-3 [2020-10-26 06:00:51,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:51,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-10-26 06:00:51,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:51,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189307185] [2020-10-26 06:00:51,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:51,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189307185] [2020-10-26 06:00:51,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095335320] [2020-10-26 06:00:51,127 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:00:51,183 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-26 06:00:51,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:00:51,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 06:00:51,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:51,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:51,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-26 06:00:51,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681366925] [2020-10-26 06:00:51,244 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:51,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:51,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2020-10-26 06:00:51,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:51,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408560235] [2020-10-26 06:00:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:51,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:51,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:51,267 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:51,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:51,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-26 06:00:51,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-26 06:00:51,314 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 9 states. [2020-10-26 06:00:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:51,354 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-10-26 06:00:51,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 06:00:51,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2020-10-26 06:00:51,356 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:51,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 43 transitions. [2020-10-26 06:00:51,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:51,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:51,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2020-10-26 06:00:51,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:51,369 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-10-26 06:00:51,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2020-10-26 06:00:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-10-26 06:00:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-26 06:00:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2020-10-26 06:00:51,376 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-26 06:00:51,376 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-26 06:00:51,377 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 06:00:51,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2020-10-26 06:00:51,377 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:51,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:51,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:51,378 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2020-10-26 06:00:51,379 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:51,380 INFO L794 eck$LassoCheckResult]: Stem: 757#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); 755#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 751#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 752#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 753#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 754#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 756#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 768#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 767#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 766#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 765#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 764#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 763#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 762#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 761#L34-3 assume !(main_~i~1 < 10); 750#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 740#L20-3 [2020-10-26 06:00:51,380 INFO L796 eck$LassoCheckResult]: Loop: 740#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 741#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 749#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 744#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 740#L20-3 [2020-10-26 06:00:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:51,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2020-10-26 06:00:51,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:51,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943015480] [2020-10-26 06:00:51,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:51,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943015480] [2020-10-26 06:00:51,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203996106] [2020-10-26 06:00:51,508 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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-26 06:00:51,578 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-26 06:00:51,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:00:51,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 06:00:51,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:51,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:51,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-26 06:00:51,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446740917] [2020-10-26 06:00:51,624 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:51,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:51,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 7 times [2020-10-26 06:00:51,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:51,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193920218] [2020-10-26 06:00:51,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:51,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:51,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:51,650 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:51,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:51,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-26 06:00:51,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-26 06:00:51,694 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 10 states. [2020-10-26 06:00:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:51,744 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-10-26 06:00:51,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 06:00:51,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2020-10-26 06:00:51,745 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:51,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 45 transitions. [2020-10-26 06:00:51,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:51,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:51,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2020-10-26 06:00:51,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:51,747 INFO L691 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2020-10-26 06:00:51,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2020-10-26 06:00:51,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-10-26 06:00:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-26 06:00:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2020-10-26 06:00:51,751 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-10-26 06:00:51,751 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-10-26 06:00:51,751 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 06:00:51,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2020-10-26 06:00:51,752 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:51,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:51,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:51,753 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2020-10-26 06:00:51,753 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:51,754 INFO L794 eck$LassoCheckResult]: Stem: 888#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); 886#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 882#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 883#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 884#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 885#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 887#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 901#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 900#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 899#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 898#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 897#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 896#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 895#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 894#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 893#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 892#L34-3 assume !(main_~i~1 < 10); 881#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 871#L20-3 [2020-10-26 06:00:51,754 INFO L796 eck$LassoCheckResult]: Loop: 871#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 872#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 880#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 875#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 871#L20-3 [2020-10-26 06:00:51,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:51,755 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2020-10-26 06:00:51,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:51,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547288535] [2020-10-26 06:00:51,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:51,841 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:51,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547288535] [2020-10-26 06:00:51,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793816706] [2020-10-26 06:00:51,842 INFO L93 rtionOrderModulation]: Changing assertion order to 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-26 06:00:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:51,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-26 06:00:51,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:51,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:51,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-26 06:00:51,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524641911] [2020-10-26 06:00:51,923 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:51,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:51,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 8 times [2020-10-26 06:00:51,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:51,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005219417] [2020-10-26 06:00:51,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:51,928 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:51,932 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:51,935 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:51,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:51,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 06:00:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-26 06:00:51,988 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. cyclomatic complexity: 12 Second operand 11 states. [2020-10-26 06:00:52,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:52,027 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2020-10-26 06:00:52,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 06:00:52,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2020-10-26 06:00:52,029 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:52,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 47 transitions. [2020-10-26 06:00:52,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:52,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:52,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2020-10-26 06:00:52,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:52,031 INFO L691 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2020-10-26 06:00:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2020-10-26 06:00:52,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-10-26 06:00:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-26 06:00:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2020-10-26 06:00:52,034 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-10-26 06:00:52,034 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-10-26 06:00:52,035 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-26 06:00:52,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2020-10-26 06:00:52,035 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:52,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:52,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:52,036 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2020-10-26 06:00:52,037 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:52,037 INFO L794 eck$LassoCheckResult]: Stem: 1029#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); 1024#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1025#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1026#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1027#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1028#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1030#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1045#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1044#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1043#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1042#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1041#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1040#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1039#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1038#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1037#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1036#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1035#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1034#L34-3 assume !(main_~i~1 < 10); 1023#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1013#L20-3 [2020-10-26 06:00:52,037 INFO L796 eck$LassoCheckResult]: Loop: 1013#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1014#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1022#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 1017#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1013#L20-3 [2020-10-26 06:00:52,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:52,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2020-10-26 06:00:52,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:52,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613823361] [2020-10-26 06:00:52,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:52,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613823361] [2020-10-26 06:00:52,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440038158] [2020-10-26 06:00:52,144 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-26 06:00:52,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 06:00:52,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:00:52,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 06:00:52,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:52,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:52,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-26 06:00:52,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108998268] [2020-10-26 06:00:52,229 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:52,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 9 times [2020-10-26 06:00:52,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:52,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9425248] [2020-10-26 06:00:52,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:52,235 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:52,240 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:52,244 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:52,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:52,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 06:00:52,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-26 06:00:52,290 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 12 Second operand 12 states. [2020-10-26 06:00:52,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:52,340 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-10-26 06:00:52,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 06:00:52,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2020-10-26 06:00:52,342 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:52,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 49 transitions. [2020-10-26 06:00:52,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:52,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:52,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2020-10-26 06:00:52,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:52,344 INFO L691 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-10-26 06:00:52,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2020-10-26 06:00:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-10-26 06:00:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-26 06:00:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2020-10-26 06:00:52,347 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-10-26 06:00:52,347 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-10-26 06:00:52,347 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-26 06:00:52,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2020-10-26 06:00:52,347 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:52,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:52,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:52,348 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2020-10-26 06:00:52,349 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:52,349 INFO L794 eck$LassoCheckResult]: Stem: 1182#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); 1177#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1178#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1179#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1180#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1181#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1183#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1200#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1199#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1198#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1197#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1196#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1195#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1194#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1193#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1192#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1191#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1190#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1189#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1188#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1187#L34-3 assume !(main_~i~1 < 10); 1176#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1166#L20-3 [2020-10-26 06:00:52,349 INFO L796 eck$LassoCheckResult]: Loop: 1166#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1167#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1175#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 1170#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1166#L20-3 [2020-10-26 06:00:52,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:52,350 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2020-10-26 06:00:52,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:52,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891175838] [2020-10-26 06:00:52,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:52,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891175838] [2020-10-26 06:00:52,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80980534] [2020-10-26 06:00:52,456 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-26 06:00:52,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-10-26 06:00:52,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:00:52,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-26 06:00:52,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:52,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:52,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-10-26 06:00:52,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521389129] [2020-10-26 06:00:52,617 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:52,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:52,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 10 times [2020-10-26 06:00:52,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:52,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426640238] [2020-10-26 06:00:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:52,626 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:52,630 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:52,633 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:52,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:52,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-26 06:00:52,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-26 06:00:52,675 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. cyclomatic complexity: 12 Second operand 13 states. [2020-10-26 06:00:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:52,730 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2020-10-26 06:00:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-26 06:00:52,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2020-10-26 06:00:52,731 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:52,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2020-10-26 06:00:52,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:52,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:52,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2020-10-26 06:00:52,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:52,733 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-10-26 06:00:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2020-10-26 06:00:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-26 06:00:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-26 06:00:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2020-10-26 06:00:52,743 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-10-26 06:00:52,743 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-10-26 06:00:52,744 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-26 06:00:52,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2020-10-26 06:00:52,744 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:52,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:52,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:52,747 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2020-10-26 06:00:52,748 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:52,749 INFO L794 eck$LassoCheckResult]: Stem: 1345#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); 1340#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1341#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1342#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1343#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1344#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1346#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1365#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1364#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1363#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1362#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1361#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1360#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1359#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1358#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1357#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1356#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1355#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1354#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1353#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1352#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1351#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1350#L34-3 assume !(main_~i~1 < 10); 1339#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1329#L20-3 [2020-10-26 06:00:52,749 INFO L796 eck$LassoCheckResult]: Loop: 1329#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1330#L21 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1338#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 1333#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1329#L20-3 [2020-10-26 06:00:52,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:52,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2020-10-26 06:00:52,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:52,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7743061] [2020-10-26 06:00:52,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:52,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:52,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:52,828 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:52,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:52,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 11 times [2020-10-26 06:00:52,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:52,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867751832] [2020-10-26 06:00:52,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:52,832 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:52,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:52,837 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:52,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1776090044, now seen corresponding path program 1 times [2020-10-26 06:00:52,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:52,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870997964] [2020-10-26 06:00:52,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:52,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:52,898 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:52,917 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:58,699 WARN L193 SmtUtils]: Spent 5.72 s on a formula simplification. DAG size of input: 251 DAG size of output: 181 [2020-10-26 06:00:59,239 WARN L193 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-10-26 06:00:59,242 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:00:59,242 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:00:59,242 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:00:59,242 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:00:59,242 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:00:59,243 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:59,243 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:00:59,243 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:00:59,243 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration12_Lasso [2020-10-26 06:00:59,243 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:00:59,243 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:00:59,255 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-26 06:00:59,269 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-26 06:00:59,281 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-26 06:00:59,283 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-26 06:00:59,287 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-26 06:00:59,291 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-26 06:00:59,294 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-26 06:00:59,297 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-26 06:00:59,301 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-26 06:00:59,305 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-26 06:00:59,308 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-26 06:00:59,316 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-26 06:00:59,318 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-26 06:00:59,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-26 06:00:59,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-26 06:00:59,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-26 06:00:59,694 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-10-26 06:00:59,738 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-26 06:00:59,742 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-26 06:00:59,748 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-26 06:00:59,750 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-26 06:00:59,754 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-26 06:00:59,757 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-26 06:00:59,759 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-26 06:00:59,771 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-26 06:00:59,774 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-26 06:01:00,185 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:01:00,185 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:00,202 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-26 06:01:00,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:00,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:00,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:00,210 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:00,259 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-26 06:01:00,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:00,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:00,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:00,270 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-26 06:01:00,301 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-26 06:01:00,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:00,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:00,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:00,306 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-26 06:01:00,331 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-26 06:01:00,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:00,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:00,338 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-26 06:01:00,366 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-26 06:01:00,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:00,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:00,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:00,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:00,409 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-26 06:01:00,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:00,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:00,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:00,413 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) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:00,437 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-26 06:01:00,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:00,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:00,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:00,441 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-26 06:01:00,464 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-26 06:01:00,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:00,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:00,472 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-26 06:01:00,499 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-26 06:01:00,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:00,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:00,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:00,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:00,531 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-26 06:01:00,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:00,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:00,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:00,535 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-26 06:01:00,559 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-26 06:01:00,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:00,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:00,565 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) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:00,590 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-26 06:01:00,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:00,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:00,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:00,594 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-26 06:01:00,619 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-26 06:01:00,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:00,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:00,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:00,625 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-26 06:01:00,650 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-26 06:01:00,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:00,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:00,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:00,655 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-26 06:01:00,696 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-26 06:01:00,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:00,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:00,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:00,709 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) [2020-10-26 06:01:00,752 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-26 06:01:00,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:00,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:00,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:00,813 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-26 06:01:00,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:00,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:00,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:00,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-26 06:01:00,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:00,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:00,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:00,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:00,923 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-26 06:01:00,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:00,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:00,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:00,972 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-26 06:01:00,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:00,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:00,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:00,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:00,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:00,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:00,988 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:01,023 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-26 06:01:01,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:01,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:01,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:01,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:01,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:01,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:01,032 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:01,063 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:01,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:01,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:01,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:01,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:01,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:01,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:01,071 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:01,097 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-26 06:01:01,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:01,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:01,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:01,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:01,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:01,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:01,117 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:01:01,156 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-26 06:01:01,156 INFO L444 ModelExtractionUtils]: 6 out of 19 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:01,160 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:01,163 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:01:01,163 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:01:01,163 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 19 Supporting invariants [] [2020-10-26 06:01:01,230 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-26 06:01:01,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:01,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 06:01:01,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:01,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:01:01,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:01,372 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-26 06:01:01,373 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-26 06:01:01,374 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-26 06:01:01,408 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 49 states and 60 transitions. Complement of second has 7 states. [2020-10-26 06:01:01,409 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-26 06:01:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 06:01:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-10-26 06:01:01,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 4 letters. [2020-10-26 06:01:01,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:01:01,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2020-10-26 06:01:01,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:01:01,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 24 letters. Loop has 8 letters. [2020-10-26 06:01:01,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:01:01,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2020-10-26 06:01:01,413 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:01,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 44 states and 52 transitions. [2020-10-26 06:01:01,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-26 06:01:01,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-26 06:01:01,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2020-10-26 06:01:01,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:01,424 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2020-10-26 06:01:01,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2020-10-26 06:01:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-10-26 06:01:01,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-26 06:01:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2020-10-26 06:01:01,430 INFO L714 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2020-10-26 06:01:01,431 INFO L594 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2020-10-26 06:01:01,431 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-26 06:01:01,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2020-10-26 06:01:01,432 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:01,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:01,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:01,435 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:01:01,435 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:01:01,436 INFO L794 eck$LassoCheckResult]: Stem: 1590#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); 1585#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1586#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1587#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1588#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1589#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1591#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1610#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1609#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1608#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1607#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1606#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1605#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1604#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1603#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1602#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1601#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1600#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1599#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1598#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1597#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1596#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1595#L34-3 assume !(main_~i~1 < 10); 1584#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1573#L20-3 assume !(max_~i~0 < 10); 1569#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1570#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1594#L20-8 [2020-10-26 06:01:01,437 INFO L796 eck$LassoCheckResult]: Loop: 1594#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1579#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1571#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 1572#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1594#L20-8 [2020-10-26 06:01:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:01,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178489, now seen corresponding path program 1 times [2020-10-26 06:01:01,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:01,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486203162] [2020-10-26 06:01:01,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-26 06:01:01,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486203162] [2020-10-26 06:01:01,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:01:01,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 06:01:01,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528485011] [2020-10-26 06:01:01,489 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:01:01,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:01,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2020-10-26 06:01:01,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:01,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083229310] [2020-10-26 06:01:01,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:01,497 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:01,499 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:01,501 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:01,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:01:01,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 06:01:01,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 06:01:01,554 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-26 06:01:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:01,615 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2020-10-26 06:01:01,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 06:01:01,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2020-10-26 06:01:01,617 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:01,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 65 transitions. [2020-10-26 06:01:01,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-26 06:01:01,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-26 06:01:01,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 65 transitions. [2020-10-26 06:01:01,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:01,621 INFO L691 BuchiCegarLoop]: Abstraction has 55 states and 65 transitions. [2020-10-26 06:01:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 65 transitions. [2020-10-26 06:01:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2020-10-26 06:01:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-26 06:01:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2020-10-26 06:01:01,625 INFO L714 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2020-10-26 06:01:01,625 INFO L594 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2020-10-26 06:01:01,625 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-26 06:01:01,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 52 transitions. [2020-10-26 06:01:01,627 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:01,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:01,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:01,628 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:01:01,628 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:01:01,629 INFO L794 eck$LassoCheckResult]: Stem: 1695#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); 1690#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1691#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1692#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1693#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1694#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1716#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1715#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1714#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1713#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1712#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1711#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1710#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1709#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1708#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1707#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1706#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1705#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1704#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1703#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1702#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1701#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1700#L34-3 assume !(main_~i~1 < 10); 1689#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1678#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1679#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1688#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 1683#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1680#L20-3 assume !(max_~i~0 < 10); 1674#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1675#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1698#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1684#L21-3 [2020-10-26 06:01:01,629 INFO L796 eck$LassoCheckResult]: Loop: 1684#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1676#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 1677#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1699#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1684#L21-3 [2020-10-26 06:01:01,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:01,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1922451645, now seen corresponding path program 1 times [2020-10-26 06:01:01,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:01,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353671280] [2020-10-26 06:01:01,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:01,682 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-26 06:01:01,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353671280] [2020-10-26 06:01:01,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209117811] [2020-10-26 06:01:01,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:01:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:01,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-26 06:01:01,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-26 06:01:01,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:01:01,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-26 06:01:01,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977825567] [2020-10-26 06:01:01,760 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:01:01,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:01,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2020-10-26 06:01:01,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:01,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036044793] [2020-10-26 06:01:01,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:01,765 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:01,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:01,769 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:01,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:01:01,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 06:01:01,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 06:01:01,864 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-26 06:01:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:01,930 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2020-10-26 06:01:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 06:01:01,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2020-10-26 06:01:01,932 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:01,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 80 transitions. [2020-10-26 06:01:01,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-10-26 06:01:01,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-10-26 06:01:01,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 80 transitions. [2020-10-26 06:01:01,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:01,934 INFO L691 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2020-10-26 06:01:01,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 80 transitions. [2020-10-26 06:01:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2020-10-26 06:01:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-26 06:01:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2020-10-26 06:01:01,937 INFO L714 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2020-10-26 06:01:01,937 INFO L594 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2020-10-26 06:01:01,937 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-26 06:01:01,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2020-10-26 06:01:01,937 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:01,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:01,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:01,939 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:01:01,939 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:01:01,939 INFO L794 eck$LassoCheckResult]: Stem: 1910#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); 1905#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1906#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1907#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1908#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1909#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1937#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1936#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1935#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1934#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1933#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1932#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1931#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1930#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1929#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1928#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1927#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1926#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1925#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1923#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1921#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1920#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1919#L34-3 assume !(main_~i~1 < 10); 1904#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1891#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1892#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1918#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 1917#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1893#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1894#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1903#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 1897#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1898#L20-3 assume !(max_~i~0 < 10); 1887#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1888#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1914#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1924#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1922#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 1915#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1913#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1899#L21-3 [2020-10-26 06:01:01,939 INFO L796 eck$LassoCheckResult]: Loop: 1899#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 1889#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 1890#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1916#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1899#L21-3 [2020-10-26 06:01:01,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:01,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1268480291, now seen corresponding path program 1 times [2020-10-26 06:01:01,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:01,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877346639] [2020-10-26 06:01:01,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-10-26 06:01:01,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877346639] [2020-10-26 06:01:01,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161302310] [2020-10-26 06:01:01,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:01:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:02,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:01:02,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-10-26 06:01:02,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:01:02,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-26 06:01:02,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920422065] [2020-10-26 06:01:02,077 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:01:02,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:02,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2020-10-26 06:01:02,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:02,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748461837] [2020-10-26 06:01:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:02,082 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:02,085 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:02,091 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:02,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:01:02,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 06:01:02,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-26 06:01:02,174 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-10-26 06:01:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:02,287 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2020-10-26 06:01:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 06:01:02,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 95 transitions. [2020-10-26 06:01:02,289 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:02,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 95 transitions. [2020-10-26 06:01:02,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-10-26 06:01:02,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-10-26 06:01:02,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 95 transitions. [2020-10-26 06:01:02,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:02,290 INFO L691 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2020-10-26 06:01:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 95 transitions. [2020-10-26 06:01:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2020-10-26 06:01:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-26 06:01:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-10-26 06:01:02,300 INFO L714 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-10-26 06:01:02,300 INFO L594 BuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-10-26 06:01:02,300 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-26 06:01:02,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 72 transitions. [2020-10-26 06:01:02,301 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:02,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:02,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:02,303 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:01:02,303 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:01:02,303 INFO L794 eck$LassoCheckResult]: Stem: 2169#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); 2164#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2165#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2166#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2167#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2168#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2170#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2197#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2196#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2195#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2194#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2193#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2192#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2191#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2190#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2189#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2188#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2187#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2186#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2185#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2184#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2182#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2181#L34-3 assume !(main_~i~1 < 10); 2163#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2149#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2150#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2203#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2202#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2151#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2152#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2162#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2155#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2156#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2177#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2198#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2183#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2176#L20-3 assume !(max_~i~0 < 10); 2145#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2146#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2173#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2157#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2158#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2174#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2175#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2201#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2147#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2148#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2200#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2179#L21-3 [2020-10-26 06:01:02,303 INFO L796 eck$LassoCheckResult]: Loop: 2179#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 2199#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2180#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2178#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2179#L21-3 [2020-10-26 06:01:02,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:02,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1567366653, now seen corresponding path program 2 times [2020-10-26 06:01:02,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:02,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093271519] [2020-10-26 06:01:02,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-10-26 06:01:02,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093271519] [2020-10-26 06:01:02,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275551915] [2020-10-26 06:01:02,417 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:01:02,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 06:01:02,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:01:02,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 06:01:02,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-10-26 06:01:02,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:01:02,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-26 06:01:02,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135987137] [2020-10-26 06:01:02,567 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:01:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:02,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2020-10-26 06:01:02,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:02,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515021116] [2020-10-26 06:01:02,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:02,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:02,583 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:02,584 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:02,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:01:02,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 06:01:02,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-26 06:01:02,662 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. cyclomatic complexity: 16 Second operand 7 states. [2020-10-26 06:01:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:02,791 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2020-10-26 06:01:02,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 06:01:02,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 110 transitions. [2020-10-26 06:01:02,794 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:02,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 110 transitions. [2020-10-26 06:01:02,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-10-26 06:01:02,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-10-26 06:01:02,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 110 transitions. [2020-10-26 06:01:02,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:02,796 INFO L691 BuchiCegarLoop]: Abstraction has 91 states and 110 transitions. [2020-10-26 06:01:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 110 transitions. [2020-10-26 06:01:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2020-10-26 06:01:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-26 06:01:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2020-10-26 06:01:02,800 INFO L714 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2020-10-26 06:01:02,800 INFO L594 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2020-10-26 06:01:02,800 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-26 06:01:02,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 82 transitions. [2020-10-26 06:01:02,801 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:02,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:02,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:02,802 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:01:02,802 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:01:02,803 INFO L794 eck$LassoCheckResult]: Stem: 2473#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); 2467#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2468#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2469#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2470#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2471#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2474#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2500#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2499#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2498#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2497#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2496#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2495#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2494#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2493#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2492#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2491#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2490#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2489#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2488#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2487#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2485#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2484#L34-3 assume !(main_~i~1 < 10); 2466#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2452#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2453#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2472#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2514#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2454#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2455#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2465#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2458#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2459#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2513#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2512#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2511#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2509#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2480#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2502#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2486#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2479#L20-3 assume !(max_~i~0 < 10); 2448#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2449#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2478#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2510#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2450#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2451#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2477#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2460#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2461#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2508#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2507#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2506#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2505#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2504#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2503#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2482#L21-3 [2020-10-26 06:01:02,803 INFO L796 eck$LassoCheckResult]: Loop: 2482#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 2501#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2483#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2481#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2482#L21-3 [2020-10-26 06:01:02,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:02,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1948283363, now seen corresponding path program 3 times [2020-10-26 06:01:02,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:02,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670535100] [2020-10-26 06:01:02,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-10-26 06:01:02,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670535100] [2020-10-26 06:01:02,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483893490] [2020-10-26 06:01:02,896 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:01:02,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-26 06:01:02,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:01:02,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 06:01:02,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-10-26 06:01:03,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:01:03,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-26 06:01:03,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707756227] [2020-10-26 06:01:03,028 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:01:03,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:03,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2020-10-26 06:01:03,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:03,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130057583] [2020-10-26 06:01:03,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:03,034 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:03,039 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:03,041 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:03,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:01:03,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 06:01:03,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-26 06:01:03,130 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. cyclomatic complexity: 18 Second operand 8 states. [2020-10-26 06:01:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:03,259 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2020-10-26 06:01:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 06:01:03,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 125 transitions. [2020-10-26 06:01:03,262 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:03,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 125 transitions. [2020-10-26 06:01:03,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2020-10-26 06:01:03,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2020-10-26 06:01:03,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 125 transitions. [2020-10-26 06:01:03,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:03,264 INFO L691 BuchiCegarLoop]: Abstraction has 103 states and 125 transitions. [2020-10-26 06:01:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 125 transitions. [2020-10-26 06:01:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2020-10-26 06:01:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-26 06:01:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2020-10-26 06:01:03,268 INFO L714 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2020-10-26 06:01:03,268 INFO L594 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2020-10-26 06:01:03,268 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-26 06:01:03,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 92 transitions. [2020-10-26 06:01:03,269 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:03,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:03,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:03,270 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:01:03,271 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:01:03,271 INFO L794 eck$LassoCheckResult]: Stem: 2821#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); 2815#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2816#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2817#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2818#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2819#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2822#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2849#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2848#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2847#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2846#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2845#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2844#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2843#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2842#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2841#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2840#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2839#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2838#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2837#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2836#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2834#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2833#L34-3 assume !(main_~i~1 < 10); 2814#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2800#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2801#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2820#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2806#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2802#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2803#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2870#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2869#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2868#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2867#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2866#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2865#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2864#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2863#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2812#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2813#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2862#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2829#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2851#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2835#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2828#L20-3 assume !(max_~i~0 < 10); 2796#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2797#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2825#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2807#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2808#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2826#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2827#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2861#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2798#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2799#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2860#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2859#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2858#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2857#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2856#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2855#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2854#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2853#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2852#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2831#L21-3 [2020-10-26 06:01:03,271 INFO L796 eck$LassoCheckResult]: Loop: 2831#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 2850#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 2832#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2830#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2831#L21-3 [2020-10-26 06:01:03,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:03,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1984866499, now seen corresponding path program 4 times [2020-10-26 06:01:03,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:03,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802699108] [2020-10-26 06:01:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2020-10-26 06:01:03,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802699108] [2020-10-26 06:01:03,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718782405] [2020-10-26 06:01:03,416 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:01:03,483 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-26 06:01:03,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:01:03,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 06:01:03,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2020-10-26 06:01:03,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:01:03,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-26 06:01:03,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966835815] [2020-10-26 06:01:03,510 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:01:03,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:03,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2020-10-26 06:01:03,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:03,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917048706] [2020-10-26 06:01:03,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:03,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:03,518 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:03,520 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:03,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:01:03,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-26 06:01:03,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-26 06:01:03,594 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. cyclomatic complexity: 20 Second operand 9 states. [2020-10-26 06:01:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:03,754 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2020-10-26 06:01:03,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 06:01:03,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 140 transitions. [2020-10-26 06:01:03,762 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:03,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 140 transitions. [2020-10-26 06:01:03,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2020-10-26 06:01:03,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2020-10-26 06:01:03,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 140 transitions. [2020-10-26 06:01:03,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:03,764 INFO L691 BuchiCegarLoop]: Abstraction has 115 states and 140 transitions. [2020-10-26 06:01:03,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 140 transitions. [2020-10-26 06:01:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 85. [2020-10-26 06:01:03,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-26 06:01:03,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2020-10-26 06:01:03,767 INFO L714 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2020-10-26 06:01:03,767 INFO L594 BuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2020-10-26 06:01:03,767 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-26 06:01:03,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 102 transitions. [2020-10-26 06:01:03,768 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:03,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:03,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:03,770 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:01:03,770 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:01:03,770 INFO L794 eck$LassoCheckResult]: Stem: 3214#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); 3208#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3209#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3210#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3211#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3212#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3215#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3242#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3241#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3240#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3239#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3238#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3237#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3236#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3235#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3234#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3233#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3232#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3231#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3230#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3229#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3227#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3226#L34-3 assume !(main_~i~1 < 10); 3207#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3193#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3194#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3213#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3199#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3195#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3196#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3271#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3270#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3269#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3268#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3267#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3266#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3265#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3264#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3263#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3262#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3261#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3260#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3205#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3206#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3259#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3222#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3244#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3228#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3221#L20-3 assume !(max_~i~0 < 10); 3189#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3190#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3218#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3200#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3201#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3219#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3220#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3258#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3191#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3192#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3257#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3256#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3255#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3254#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3253#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3252#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3251#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3250#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3249#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3248#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3247#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3246#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3245#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3224#L21-3 [2020-10-26 06:01:03,771 INFO L796 eck$LassoCheckResult]: Loop: 3224#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 3243#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3225#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3223#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3224#L21-3 [2020-10-26 06:01:03,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:03,771 INFO L82 PathProgramCache]: Analyzing trace with hash -325846691, now seen corresponding path program 5 times [2020-10-26 06:01:03,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:03,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342658313] [2020-10-26 06:01:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-10-26 06:01:03,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342658313] [2020-10-26 06:01:03,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771412768] [2020-10-26 06:01:03,874 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:01:03,990 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2020-10-26 06:01:03,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:01:03,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 06:01:03,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-10-26 06:01:04,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:01:04,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-26 06:01:04,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894056813] [2020-10-26 06:01:04,039 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:01:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:04,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 7 times [2020-10-26 06:01:04,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:04,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931335941] [2020-10-26 06:01:04,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:04,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:04,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:04,060 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:04,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:01:04,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-26 06:01:04,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-26 06:01:04,138 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. cyclomatic complexity: 22 Second operand 10 states. [2020-10-26 06:01:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:04,325 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2020-10-26 06:01:04,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 06:01:04,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 155 transitions. [2020-10-26 06:01:04,328 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:04,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 127 states and 155 transitions. [2020-10-26 06:01:04,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2020-10-26 06:01:04,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2020-10-26 06:01:04,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 155 transitions. [2020-10-26 06:01:04,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:04,330 INFO L691 BuchiCegarLoop]: Abstraction has 127 states and 155 transitions. [2020-10-26 06:01:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 155 transitions. [2020-10-26 06:01:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 93. [2020-10-26 06:01:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-26 06:01:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2020-10-26 06:01:04,334 INFO L714 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2020-10-26 06:01:04,334 INFO L594 BuchiCegarLoop]: Abstraction has 93 states and 112 transitions. [2020-10-26 06:01:04,334 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-26 06:01:04,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 112 transitions. [2020-10-26 06:01:04,335 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:04,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:04,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:04,337 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:01:04,337 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:01:04,338 INFO L794 eck$LassoCheckResult]: Stem: 3651#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); 3646#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3647#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3648#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3649#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3650#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3652#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3679#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3678#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3677#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3676#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3675#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3674#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3673#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3672#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3671#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3670#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3669#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3668#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3667#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3666#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 3664#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 3663#L34-3 assume !(main_~i~1 < 10); 3645#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3631#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3632#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3643#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3644#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3633#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3634#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3717#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3638#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3639#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3716#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3715#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3714#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3713#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3712#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3711#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3710#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3709#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3708#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3707#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3706#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3705#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3704#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3703#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3702#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3699#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3659#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3681#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3665#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3658#L20-3 assume !(max_~i~0 < 10); 3629#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3630#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3656#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3701#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3700#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3657#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3655#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3637#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3627#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3628#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3698#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3697#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3696#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3695#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3694#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3693#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3692#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3691#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3690#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3689#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3688#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3687#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3686#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3685#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 3684#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3683#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3682#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3661#L21-3 [2020-10-26 06:01:04,338 INFO L796 eck$LassoCheckResult]: Loop: 3661#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 3680#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 3662#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 3660#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3661#L21-3 [2020-10-26 06:01:04,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:04,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1241910147, now seen corresponding path program 6 times [2020-10-26 06:01:04,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:04,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341732828] [2020-10-26 06:01:04,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2020-10-26 06:01:04,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341732828] [2020-10-26 06:01:04,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981997502] [2020-10-26 06:01:04,490 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:01:04,875 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2020-10-26 06:01:04,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:01:04,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-26 06:01:04,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2020-10-26 06:01:04,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:01:04,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-26 06:01:04,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988862059] [2020-10-26 06:01:04,916 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:01:04,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 8 times [2020-10-26 06:01:04,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:04,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882436293] [2020-10-26 06:01:04,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:04,930 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:04,934 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:04,936 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:05,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:01:05,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 06:01:05,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-26 06:01:05,014 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. cyclomatic complexity: 24 Second operand 11 states. [2020-10-26 06:01:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:05,225 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2020-10-26 06:01:05,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 06:01:05,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 170 transitions. [2020-10-26 06:01:05,228 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:05,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 139 states and 170 transitions. [2020-10-26 06:01:05,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-10-26 06:01:05,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-10-26 06:01:05,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 170 transitions. [2020-10-26 06:01:05,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:05,230 INFO L691 BuchiCegarLoop]: Abstraction has 139 states and 170 transitions. [2020-10-26 06:01:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 170 transitions. [2020-10-26 06:01:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 101. [2020-10-26 06:01:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-26 06:01:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2020-10-26 06:01:05,234 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2020-10-26 06:01:05,234 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 122 transitions. [2020-10-26 06:01:05,234 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-26 06:01:05,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 122 transitions. [2020-10-26 06:01:05,235 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:05,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:05,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:05,237 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:01:05,237 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:01:05,238 INFO L794 eck$LassoCheckResult]: Stem: 4135#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); 4129#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4130#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4131#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4132#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4133#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4136#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4162#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4161#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4160#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4159#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4158#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4157#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4156#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4155#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4154#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4153#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4152#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4151#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4150#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4149#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4147#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4146#L34-3 assume !(main_~i~1 < 10); 4128#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 4114#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4115#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4134#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4208#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4116#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4117#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4127#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4120#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4121#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4207#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4206#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4205#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4204#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4203#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4202#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4201#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4200#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4199#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4198#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4197#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4196#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4195#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4194#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4193#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4192#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4191#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4190#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4189#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4187#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4142#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4164#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4148#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4141#L20-3 assume !(max_~i~0 < 10); 4110#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4111#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 4140#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4188#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4112#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4113#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4139#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4122#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4123#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4186#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4185#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4184#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4183#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4182#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4181#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4180#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4179#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4178#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4177#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4176#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4175#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4174#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4173#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4172#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4171#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4170#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4169#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4168#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4167#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4166#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4165#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4144#L21-3 [2020-10-26 06:01:05,238 INFO L796 eck$LassoCheckResult]: Loop: 4144#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 4163#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4145#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4143#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4144#L21-3 [2020-10-26 06:01:05,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:05,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1930807453, now seen corresponding path program 7 times [2020-10-26 06:01:05,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:05,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880542751] [2020-10-26 06:01:05,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2020-10-26 06:01:05,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880542751] [2020-10-26 06:01:05,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135167291] [2020-10-26 06:01:05,376 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:01:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:05,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 06:01:05,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2020-10-26 06:01:05,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:01:05,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-26 06:01:05,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385357219] [2020-10-26 06:01:05,507 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:01:05,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:05,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 9 times [2020-10-26 06:01:05,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:05,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309849113] [2020-10-26 06:01:05,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:05,512 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:05,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:05,516 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:05,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:01:05,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 06:01:05,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-26 06:01:05,594 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. cyclomatic complexity: 26 Second operand 12 states. [2020-10-26 06:01:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:05,811 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2020-10-26 06:01:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 06:01:05,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 185 transitions. [2020-10-26 06:01:05,813 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:05,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 185 transitions. [2020-10-26 06:01:05,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2020-10-26 06:01:05,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-10-26 06:01:05,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 185 transitions. [2020-10-26 06:01:05,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:05,816 INFO L691 BuchiCegarLoop]: Abstraction has 151 states and 185 transitions. [2020-10-26 06:01:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 185 transitions. [2020-10-26 06:01:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 109. [2020-10-26 06:01:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-26 06:01:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2020-10-26 06:01:05,820 INFO L714 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2020-10-26 06:01:05,820 INFO L594 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2020-10-26 06:01:05,820 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-10-26 06:01:05,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 132 transitions. [2020-10-26 06:01:05,821 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:05,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:05,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:05,822 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:01:05,823 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:01:05,823 INFO L794 eck$LassoCheckResult]: Stem: 4662#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); 4657#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4658#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4659#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4660#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4661#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4663#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4689#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4688#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4687#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4686#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4685#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4684#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4683#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4682#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4681#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4680#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4679#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4678#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4677#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4676#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 4674#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 4673#L34-3 assume !(main_~i~1 < 10); 4656#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 4642#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4643#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4744#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4648#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4644#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4645#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4654#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4655#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4743#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4742#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4741#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4740#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4739#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4738#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4737#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4736#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4735#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4734#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4733#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4732#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4731#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4730#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4729#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4728#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4727#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4726#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4725#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4724#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4723#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4722#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4721#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4720#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4719#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4669#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4691#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4675#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4668#L20-3 assume !(max_~i~0 < 10); 4638#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4639#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 4667#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4718#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4640#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4641#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4666#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4649#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4650#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4717#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4716#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4715#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4714#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4713#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4712#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4711#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4710#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4709#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4708#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4707#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4706#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4705#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4704#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4703#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4702#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4701#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4700#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4699#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4698#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4697#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4696#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4695#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 4694#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4693#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4692#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4671#L21-3 [2020-10-26 06:01:05,823 INFO L796 eck$LassoCheckResult]: Loop: 4671#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 4690#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 4672#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 4670#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4671#L21-3 [2020-10-26 06:01:05,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:05,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1557788093, now seen corresponding path program 8 times [2020-10-26 06:01:05,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:05,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661803765] [2020-10-26 06:01:05,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-10-26 06:01:06,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661803765] [2020-10-26 06:01:06,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671321583] [2020-10-26 06:01:06,009 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:01:06,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 06:01:06,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:01:06,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-26 06:01:06,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-10-26 06:01:06,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:01:06,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-10-26 06:01:06,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389407827] [2020-10-26 06:01:06,150 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:01:06,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:06,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 10 times [2020-10-26 06:01:06,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:06,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776717582] [2020-10-26 06:01:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:06,155 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:06,158 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:06,159 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:06,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:01:06,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-26 06:01:06,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-26 06:01:06,254 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. cyclomatic complexity: 28 Second operand 13 states. [2020-10-26 06:01:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:06,515 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2020-10-26 06:01:06,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-26 06:01:06,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 188 transitions. [2020-10-26 06:01:06,519 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:06,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 188 transitions. [2020-10-26 06:01:06,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2020-10-26 06:01:06,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2020-10-26 06:01:06,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 188 transitions. [2020-10-26 06:01:06,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:06,521 INFO L691 BuchiCegarLoop]: Abstraction has 154 states and 188 transitions. [2020-10-26 06:01:06,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 188 transitions. [2020-10-26 06:01:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2020-10-26 06:01:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-26 06:01:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2020-10-26 06:01:06,525 INFO L714 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2020-10-26 06:01:06,525 INFO L594 BuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2020-10-26 06:01:06,525 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-10-26 06:01:06,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 142 transitions. [2020-10-26 06:01:06,526 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:01:06,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:06,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:06,527 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:01:06,527 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:01:06,528 INFO L794 eck$LassoCheckResult]: Stem: 5226#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); 5221#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5222#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5223#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5224#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5225#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5268#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5266#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5264#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5262#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5260#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5258#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5256#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5254#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5252#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5250#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5248#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5246#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5244#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5242#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5240#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5238#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5237#L34-3 assume !(main_~i~1 < 10); 5220#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 5206#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5207#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5218#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5219#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5208#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5209#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5316#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5315#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5314#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5313#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5312#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5311#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5310#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5309#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5308#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5307#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5306#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5305#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5304#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5213#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5214#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5303#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5302#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5301#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5300#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5299#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5298#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5296#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5294#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5292#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5290#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5288#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5286#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5284#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5282#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5280#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5278#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5232#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5275#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5273#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5231#L20-3 assume !(max_~i~0 < 10); 5204#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5205#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 5229#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5212#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5202#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5203#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5230#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5297#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5295#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5293#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5291#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5289#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5287#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5285#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5283#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5281#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5279#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5277#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5276#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5274#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5272#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5271#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5270#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5269#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5267#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5265#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5263#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5261#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5259#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5257#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5255#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5253#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5251#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5249#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5247#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5245#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5243#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5241#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5239#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5234#L21-3 [2020-10-26 06:01:06,528 INFO L796 eck$LassoCheckResult]: Loop: 5234#L21-3 assume max_~ret~0 < max_#t~mem4;call max_#t~mem5 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite6 := max_#t~mem5; 5236#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5235#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5233#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5234#L21-3 [2020-10-26 06:01:06,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2012806109, now seen corresponding path program 9 times [2020-10-26 06:01:06,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:06,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843873385] [2020-10-26 06:01:06,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:06,634 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:06,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:06,763 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:06,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:06,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 11 times [2020-10-26 06:01:06,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:06,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991049402] [2020-10-26 06:01:06,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:06,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:06,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:06,772 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:06,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:06,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1723510376, now seen corresponding path program 1 times [2020-10-26 06:01:06,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:06,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883341701] [2020-10-26 06:01:06,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 153 proven. 37 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2020-10-26 06:01:06,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883341701] [2020-10-26 06:01:06,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852327767] [2020-10-26 06:01:06,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:01:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:07,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-26 06:01:07,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2020-10-26 06:01:07,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-26 06:01:07,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2020-10-26 06:01:07,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170683516] [2020-10-26 06:01:07,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:01:07,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-26 06:01:07,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-10-26 06:01:07,204 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. cyclomatic complexity: 30 Second operand 13 states. [2020-10-26 06:01:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:07,494 INFO L93 Difference]: Finished difference Result 154 states and 185 transitions. [2020-10-26 06:01:07,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-26 06:01:07,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 185 transitions. [2020-10-26 06:01:07,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:01:07,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 112 states and 133 transitions. [2020-10-26 06:01:07,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-10-26 06:01:07,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-10-26 06:01:07,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 133 transitions. [2020-10-26 06:01:07,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:07,501 INFO L691 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2020-10-26 06:01:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 133 transitions. [2020-10-26 06:01:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-26 06:01:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-26 06:01:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2020-10-26 06:01:07,508 INFO L714 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2020-10-26 06:01:07,508 INFO L594 BuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2020-10-26 06:01:07,508 INFO L427 BuchiCegarLoop]: ======== Iteration 24============ [2020-10-26 06:01:07,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 133 transitions. [2020-10-26 06:01:07,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:01:07,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:07,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:07,514 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:01:07,515 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:01:07,515 INFO L794 eck$LassoCheckResult]: Stem: 5829#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); 5824#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, 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(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5825#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5826#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5827#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5828#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5879#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5876#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5873#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5870#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5867#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5864#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5861#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5858#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5855#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5852#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5849#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5846#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5843#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5840#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5838#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 5836#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 5835#L34-3 assume !(main_~i~1 < 10); 5823#L34-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 5815#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5816#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5822#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5817#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5818#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5922#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5921#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5920#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5918#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5916#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5914#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5912#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5910#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5908#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5906#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5904#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5902#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5900#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5898#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5896#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5894#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5892#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5890#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5888#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5886#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5883#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5881#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5878#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5875#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5872#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5869#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5866#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5863#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5860#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5857#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5854#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5851#L20-3 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5848#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5845#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5842#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5834#L20-3 assume !(max_~i~0 < 10); 5811#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5812#L23 main_#t~ret9 := max_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem4, max_#t~ite6, max_#t~mem5, max_#t~post3, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 5832#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5819#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5813#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5814#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5833#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5919#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5917#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5915#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5913#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5911#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5909#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5907#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5905#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5903#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5901#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5899#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5897#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5895#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5893#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5891#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5889#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5887#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5885#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5884#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5882#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5880#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5877#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5874#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5871#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5868#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5865#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5862#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5859#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5856#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5853#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5850#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5847#L20-8 assume !!(max_~i~0 < 10);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5844#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 5841#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem4;havoc max_#t~mem5; 5839#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 5837#L20-8 assume !(max_~i~0 < 10); 5830#L20-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5831#L23-1 main_#t~ret12 := max_#res;main_~ret2~0 := main_#t~ret12;havoc main_#t~ret12;call main_#t~mem13 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem13;havoc main_#t~mem13;main_~i~2 := 0; 5820#L43-3 [2020-10-26 06:01:07,516 INFO L796 eck$LassoCheckResult]: Loop: 5820#L43-3 assume !!(main_~i~2 < 9);call main_#t~mem15 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem15, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem15; 5821#L43-2 main_#t~post14 := main_~i~2;main_~i~2 := 1 + main_#t~post14;havoc main_#t~post14; 5820#L43-3 [2020-10-26 06:01:07,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1621163222, now seen corresponding path program 1 times [2020-10-26 06:01:07,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:07,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046254331] [2020-10-26 06:01:07,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:07,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:07,758 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:07,777 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:07,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:07,778 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2020-10-26 06:01:07,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:07,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735932434] [2020-10-26 06:01:07,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:07,782 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:07,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:07,785 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:07,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:07,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1135269864, now seen corresponding path program 1 times [2020-10-26 06:01:07,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:07,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368589035] [2020-10-26 06:01:07,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:07,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:08,019 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:08,042 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:37,258 WARN L193 SmtUtils]: Spent 29.14 s on a formula simplification. DAG size of input: 717 DAG size of output: 502 [2020-10-26 06:01:43,109 WARN L193 SmtUtils]: Spent 5.60 s on a formula simplification. DAG size of input: 245 DAG size of output: 183 [2020-10-26 06:01:43,117 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:01:43,117 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:01:43,117 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:01:43,118 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:01:43,118 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:01:43,118 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:43,118 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:01:43,118 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:01:43,118 INFO L133 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration24_Lasso [2020-10-26 06:01:43,118 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:01:43,119 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:01:43,125 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-26 06:01:43,146 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-26 06:01:43,152 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-26 06:01:43,158 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-26 06:01:43,169 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-26 06:01:43,176 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-26 06:01:43,182 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-26 06:01:43,188 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-26 06:01:43,195 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-26 06:01:43,201 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-26 06:01:43,207 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-26 06:01:43,213 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-26 06:01:43,218 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-26 06:01:43,224 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-26 06:01:43,230 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-26 06:01:43,237 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-26 06:01:43,242 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-26 06:01:45,717 WARN L193 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 100 [2020-10-26 06:01:45,943 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-10-26 06:01:45,945 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-26 06:01:45,951 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-26 06:01:45,956 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-26 06:01:45,965 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-26 06:01:47,036 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:01:47,036 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,043 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-26 06:01:47,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:47,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:47,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:47,048 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:47,075 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-26 06:01:47,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:47,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:47,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,081 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 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,110 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-26 06:01:47,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:47,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:47,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:47,113 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 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,139 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-26 06:01:47,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:47,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:47,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:47,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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:47,172 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:47,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:47,178 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 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,203 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-26 06:01:47,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:47,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:47,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:47,207 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 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,232 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-26 06:01:47,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:47,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:47,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:47,236 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 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,262 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-26 06:01:47,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:47,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:47,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:47,265 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 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,292 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-26 06:01:47,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:47,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:47,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:47,295 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 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,322 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-26 06:01:47,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:47,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:47,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:47,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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:47,370 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-26 06:01:47,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:47,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,414 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-26 06:01:47,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:47,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:47,421 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 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,446 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-26 06:01:47,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:47,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:47,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:47,456 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:47,499 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-26 06:01:47,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:47,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:47,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,509 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:47,551 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-26 06:01:47,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:47,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,562 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:47,605 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-26 06:01:47,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:47,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:47,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,611 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:47,654 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-26 06:01:47,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:47,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,664 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:47,708 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-26 06:01:47,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:47,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,721 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:47,764 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-26 06:01:47,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:47,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,772 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:47,816 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-26 06:01:47,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:47,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:47,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,825 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:47,868 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-26 06:01:47,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:47,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,879 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 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:01:47,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:47,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:47,934 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:47,973 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-26 06:01:47,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:47,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:47,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:47,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:47,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:47,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:47,987 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:48,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-26 06:01:48,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:48,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:48,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:48,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:48,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:48,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:48,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:48,035 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:48,073 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-26 06:01:48,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:48,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:48,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:48,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:48,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:48,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:48,085 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:01:48,123 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-26 06:01:48,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:48,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:48,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:48,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:48,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:48,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:48,131 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 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:48,170 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-26 06:01:48,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:48,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:48,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:48,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:48,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:48,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:48,175 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 99 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:48,200 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-26 06:01:48,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:48,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:48,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:48,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:48,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:48,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:48,205 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 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:48,229 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-26 06:01:48,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:48,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:48,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:48,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:48,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:48,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:48,234 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 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:48,258 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-26 06:01:48,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:48,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:48,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:48,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:48,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:48,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:48,262 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 102 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:48,287 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-26 06:01:48,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:48,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:48,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:48,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:48,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:48,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:48,292 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 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:48,316 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-26 06:01:48,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:48,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:48,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:48,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:48,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:48,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:48,321 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 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:48,346 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-26 06:01:48,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:48,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:48,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:48,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:48,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:48,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:48,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:48,350 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 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:48,377 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-26 06:01:48,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:48,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:48,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:48,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:48,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:48,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:48,409 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:01:48,485 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2020-10-26 06:01:48,485 INFO L444 ModelExtractionUtils]: 7 out of 28 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:48,488 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 06:01:48,491 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:01:48,491 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:01:48,492 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3) = -16*ULTIMATE.start_main_~i~2 + 17*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 Supporting invariants [] [2020-10-26 06:01:49,150 INFO L297 tatePredicateManager]: 86 out of 86 supporting invariants were superfluous and have been removed [2020-10-26 06:01:49,152 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 06:01:49,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:49,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 06:01:49,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:49,289 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 06:01:49,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:49,322 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-26 06:01:49,322 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-26 06:01:49,323 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23 Second operand 3 states. [2020-10-26 06:01:49,344 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23. Second operand 3 states. Result 114 states and 136 transitions. Complement of second has 4 states. [2020-10-26 06:01:49,346 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-26 06:01:49,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 06:01:49,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2020-10-26 06:01:49,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 2 letters. [2020-10-26 06:01:49,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:01:49,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 112 letters. Loop has 2 letters. [2020-10-26 06:01:49,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:01:49,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 4 letters. [2020-10-26 06:01:49,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:01:49,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 136 transitions. [2020-10-26 06:01:49,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 06:01:49,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 0 states and 0 transitions. [2020-10-26 06:01:49,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 06:01:49,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 06:01:49,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 06:01:49,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:49,353 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 06:01:49,353 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 06:01:49,353 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 06:01:49,353 INFO L427 BuchiCegarLoop]: ======== Iteration 25============ [2020-10-26 06:01:49,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 06:01:49,354 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 06:01:49,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 06:01:49,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 06:01:49 BoogieIcfgContainer [2020-10-26 06:01:49,361 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 06:01:49,362 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 06:01:49,362 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 06:01:49,363 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 06:01:49,363 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:00:45" (3/4) ... [2020-10-26 06:01:49,367 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 06:01:49,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 06:01:49,369 INFO L168 Benchmark]: Toolchain (without parser) took 64972.33 ms. Allocated memory was 39.8 MB in the beginning and 184.5 MB in the end (delta: 144.7 MB). Free memory was 20.4 MB in the beginning and 76.7 MB in the end (delta: -56.3 MB). Peak memory consumption was 89.4 MB. Max. memory is 16.1 GB. [2020-10-26 06:01:49,369 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 39.8 MB. Free memory is still 25.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:01:49,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.69 ms. Allocated memory is still 39.8 MB. Free memory was 19.8 MB in the beginning and 18.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 06:01:49,370 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.62 ms. Allocated memory is still 39.8 MB. Free memory was 18.7 MB in the beginning and 17.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 06:01:49,370 INFO L168 Benchmark]: Boogie Preprocessor took 39.90 ms. Allocated memory is still 39.8 MB. Free memory was 17.0 MB in the beginning and 15.6 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:01:49,371 INFO L168 Benchmark]: RCFGBuilder took 671.56 ms. Allocated memory was 39.8 MB in the beginning and 50.3 MB in the end (delta: 10.5 MB). Free memory was 15.4 MB in the beginning and 30.9 MB in the end (delta: -15.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. [2020-10-26 06:01:49,372 INFO L168 Benchmark]: BuchiAutomizer took 63831.79 ms. Allocated memory was 50.3 MB in the beginning and 184.5 MB in the end (delta: 134.2 MB). Free memory was 30.6 MB in the beginning and 76.7 MB in the end (delta: -46.1 MB). Peak memory consumption was 89.2 MB. Max. memory is 16.1 GB. [2020-10-26 06:01:49,372 INFO L168 Benchmark]: Witness Printer took 5.62 ms. Allocated memory is still 184.5 MB. Free memory is still 76.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:01:49,374 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.47 ms. Allocated memory is still 39.8 MB. Free memory is still 25.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 358.69 ms. Allocated memory is still 39.8 MB. Free memory was 19.8 MB in the beginning and 18.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.62 ms. Allocated memory is still 39.8 MB. Free memory was 18.7 MB in the beginning and 17.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.90 ms. Allocated memory is still 39.8 MB. Free memory was 17.0 MB in the beginning and 15.6 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 671.56 ms. Allocated memory was 39.8 MB in the beginning and 50.3 MB in the end (delta: 10.5 MB). Free memory was 15.4 MB in the beginning and 30.9 MB in the end (delta: -15.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 63831.79 ms. Allocated memory was 50.3 MB in the beginning and 184.5 MB in the end (delta: 134.2 MB). Free memory was 30.6 MB in the beginning and 76.7 MB in the end (delta: -46.1 MB). Peak memory consumption was 89.2 MB. Max. memory is 16.1 GB. * Witness Printer took 5.62 ms. Allocated memory is still 184.5 MB. Free memory is still 76.7 MB. There was no memory consumed. Max. memory is 16.1 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 24 terminating modules (21 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function -16 * i + 17 * unknown-#length-unknown[x] and consists of 3 locations. 21 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 63.7s and 25 iterations. TraceHistogramMax:10. Analysis of lassos took 60.1s. Construction of modules took 1.6s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 24. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 280 StatesRemovedByMinimization, 19 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 117 states and ocurred in iteration 22. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 638 SDtfs, 1144 SDslu, 1940 SDs, 0 SdLazy, 1117 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital408 mio100 ax100 hnf99 lsp96 ukn43 mio100 lsp43 div100 bol100 ite100 ukn100 eq175 hnf88 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...