./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/max05-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 6ae365f36af85d643f41b38559013209b3bcedb0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 20:23:51,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:23:51,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:23:51,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:23:51,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:23:51,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:23:51,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:23:51,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:23:51,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:23:51,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:23:51,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:23:51,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:23:51,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:23:51,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:23:51,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:23:51,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:23:51,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:23:51,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:23:51,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:23:51,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:23:51,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:23:51,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:23:51,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:23:51,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:23:51,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:23:51,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:23:51,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:23:51,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:23:51,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:23:51,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:23:51,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:23:51,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:23:51,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:23:51,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:23:51,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:23:51,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:23:51,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:23:51,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:23:51,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:23:51,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:23:51,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:23:51,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 20:23:51,791 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:23:51,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:23:51,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:23:51,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:23:51,793 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:23:51,794 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:23:51,794 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:23:51,794 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:23:51,795 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:23:51,795 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:23:51,796 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:23:51,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:23:51,797 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:23:51,797 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:23:51,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:23:51,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:23:51,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:23:51,798 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:23:51,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:23:51,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:23:51,799 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:23:51,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:23:51,800 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:23:51,800 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:23:51,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:23:51,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:23:51,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:23:51,801 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:23:51,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:23:51,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:23:51,802 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:23:51,802 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:23:51,804 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:23:51,804 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ae365f36af85d643f41b38559013209b3bcedb0 [2020-10-19 20:23:52,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:23:52,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:23:52,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:23:52,124 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:23:52,124 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:23:52,125 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max05-1.i [2020-10-19 20:23:52,193 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a0eb046e/fc7d3020af39489ba288255b9cdc15d6/FLAG02afe0bbc [2020-10-19 20:23:52,620 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:23:52,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i [2020-10-19 20:23:52,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a0eb046e/fc7d3020af39489ba288255b9cdc15d6/FLAG02afe0bbc [2020-10-19 20:23:52,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a0eb046e/fc7d3020af39489ba288255b9cdc15d6 [2020-10-19 20:23:52,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:23:53,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:23:53,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:23:53,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:23:53,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:23:53,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:23:52" (1/1) ... [2020-10-19 20:23:53,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3d233d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:53, skipping insertion in model container [2020-10-19 20:23:53,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:23:52" (1/1) ... [2020-10-19 20:23:53,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:23:53,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:23:53,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:23:53,261 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:23:53,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:23:53,362 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:23:53,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:53 WrapperNode [2020-10-19 20:23:53,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:23:53,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:23:53,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:23:53,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:23:53,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:53" (1/1) ... [2020-10-19 20:23:53,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:53" (1/1) ... [2020-10-19 20:23:53,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:23:53,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:23:53,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:23:53,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:23:53,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:53" (1/1) ... [2020-10-19 20:23:53,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:53" (1/1) ... [2020-10-19 20:23:53,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:53" (1/1) ... [2020-10-19 20:23:53,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:53" (1/1) ... [2020-10-19 20:23:53,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:53" (1/1) ... [2020-10-19 20:23:53,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:53" (1/1) ... [2020-10-19 20:23:53,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:53" (1/1) ... [2020-10-19 20:23:53,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:23:53,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:23:53,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:23:53,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:23:53,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:53,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 20:23:53,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:23:53,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 20:23:53,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:23:53,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:23:53,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 20:23:53,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 20:23:53,835 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:23:53,836 INFO L298 CfgBuilder]: Removed 17 assume(true) statements. [2020-10-19 20:23:53,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:23:53 BoogieIcfgContainer [2020-10-19 20:23:53,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:23:53,839 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:23:53,839 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:23:53,845 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:23:53,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:23:53,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:23:52" (1/3) ... [2020-10-19 20:23:53,848 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f643579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:23:53, skipping insertion in model container [2020-10-19 20:23:53,848 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:23:53,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:23:53" (2/3) ... [2020-10-19 20:23:53,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f643579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:23:53, skipping insertion in model container [2020-10-19 20:23:53,850 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:23:53,850 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:23:53" (3/3) ... [2020-10-19 20:23:53,852 INFO L373 chiAutomizerObserver]: Analyzing ICFG max05-1.i [2020-10-19 20:23:53,904 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:23:53,904 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:23:53,904 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:23:53,905 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:23:53,905 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:23:53,907 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:23:53,907 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:23:53,907 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:23:53,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-10-19 20:23:53,952 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-10-19 20:23:53,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:23:53,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:23:53,962 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 20:23:53,963 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:23:53,963 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:23:53,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-10-19 20:23:53,967 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-10-19 20:23:53,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:23:53,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:23:53,967 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 20:23:53,968 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:23:53,974 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 9#L34-3true [2020-10-19 20:23:53,974 INFO L796 eck$LassoCheckResult]: Loop: 9#L34-3true assume !!(main_~i~1 < 5);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-19 20:23:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:53,980 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 20:23:53,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:53,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525873281] [2020-10-19 20:23:53,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:54,091 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:54,116 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:54,138 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:23:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:54,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-19 20:23:54,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:54,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734305597] [2020-10-19 20:23:54,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:54,152 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:54,158 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:54,161 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:23:54,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:54,163 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-19 20:23:54,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:54,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983539534] [2020-10-19 20:23:54,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:54,186 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:54,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:54,210 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:23:54,461 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-10-19 20:23:54,560 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:23:54,561 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:23:54,561 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:23:54,561 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:23:54,562 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:23:54,562 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:54,562 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:23:54,563 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:23:54,563 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration1_Lasso [2020-10-19 20:23:54,563 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:23:54,563 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:23:54,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:54,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:55,161 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:23:55,167 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:55,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:55,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:55,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:55,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:55,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:55,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:55,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:55,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:23:55,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:55,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:55,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:55,272 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-19 20:23:55,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:23:55,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:23:55,314 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:55,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:55,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:55,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:55,361 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-19 20:23:55,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:55,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:55,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:55,401 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-19 20:23:55,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:55,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:55,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:55,436 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-19 20:23:55,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:23:55,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:23:55,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:55,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:55,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:55,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:55,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:55,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:23:55,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:23:55,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-19 20:23:55,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:55,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:55,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:55,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:55,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:55,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:55,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:55,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:55,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:55,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:55,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:55,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:55,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:55,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:55,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:55,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:55,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:55,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:55,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:55,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:55,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:55,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:55,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:55,791 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:55,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:55,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:23:55,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:23:55,824 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) [2020-10-19 20:23:55,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:55,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:55,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:55,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:55,883 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) [2020-10-19 20:23:55,932 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:55,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:55,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:55,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:55,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:55,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:23:55,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:23:55,946 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-19 20:23:56,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:56,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:56,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:56,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:56,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:56,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:23:56,010 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-19 20:23:56,015 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-19 20:23:56,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:56,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:56,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:56,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:56,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:56,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:23:56,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:23:56,066 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-19 20:23:56,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:56,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:56,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:56,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:56,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:56,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:23:56,112 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-19 20:23:56,121 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:56,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:56,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:56,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:56,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:56,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:56,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:56,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:56,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:23:56,156 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:56,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:56,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:56,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:56,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:56,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:56,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:23:56,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:23:56,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:56,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:56,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:56,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:56,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:56,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:56,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:23:56,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:23:56,253 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-19 20:23:56,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-19 20:23:56,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:56,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:56,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:56,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:56,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:23:56,304 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-19 20:23:56,318 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:23:56,341 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-19 20:23:56,342 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:23:56,350 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-19 20:23:56,355 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:23:56,355 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:23:56,356 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) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2020-10-19 20:23:56,510 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-19 20:23:56,520 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:23:56,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:23:56,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:23:56,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:23:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:23:56,573 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 20:23:56,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:23:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:23:56,625 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 20:23:56,627 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states. Second operand 3 states. [2020-10-19 20:23:56,741 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-19 20:23:56,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:23:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:23:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2020-10-19 20:23:56,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-19 20:23:56,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:23:56,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-19 20:23:56,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:23:56,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-19 20:23:56,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:23:56,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 124 transitions. [2020-10-19 20:23:56,754 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:23:56,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 25 states and 33 transitions. [2020-10-19 20:23:56,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-19 20:23:56,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:23:56,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2020-10-19 20:23:56,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:23:56,762 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-19 20:23:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2020-10-19 20:23:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-19 20:23:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 20:23:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-10-19 20:23:56,791 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-19 20:23:56,792 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-19 20:23:56,792 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:23:56,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2020-10-19 20:23:56,793 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:23:56,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:23:56,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:23:56,793 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 20:23:56,794 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:23:56,794 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(20);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 < 5); 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-19 20:23:56,794 INFO L796 eck$LassoCheckResult]: Loop: 193#L20-3 assume !!(max_~i~0 < 5);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~mem5;havoc max_#t~mem4; 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-19 20:23:56,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-10-19 20:23:56,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:56,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47940832] [2020-10-19 20:23:56,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:23:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:23:56,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47940832] [2020-10-19 20:23:56,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:23:56,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:23:56,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807076863] [2020-10-19 20:23:56,846 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:23:56,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:56,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2020-10-19 20:23:56,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:56,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488146597] [2020-10-19 20:23:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:56,855 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:56,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:56,863 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:23:56,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:23:56,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:23:56,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:23:56,912 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-19 20:23:56,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:23:56,926 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-10-19 20:23:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:23:56,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2020-10-19 20:23:56,928 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:23:56,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2020-10-19 20:23:56,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:23:56,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:23:56,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2020-10-19 20:23:56,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:23:56,930 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-10-19 20:23:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2020-10-19 20:23:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-10-19 20:23:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 20:23:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-19 20:23:56,933 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-19 20:23:56,933 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-19 20:23:56,933 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:23:56,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2020-10-19 20:23:56,934 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:23:56,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:23:56,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:23:56,935 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-19 20:23:56,935 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:23:56,935 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(20);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 < 5);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 < 5); 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-19 20:23:56,935 INFO L796 eck$LassoCheckResult]: Loop: 250#L20-3 assume !!(max_~i~0 < 5);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~mem5;havoc max_#t~mem4; 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-19 20:23:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:56,935 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-10-19 20:23:56,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:56,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386149415] [2020-10-19 20:23:56,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:23:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:23:56,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386149415] [2020-10-19 20:23:56,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853620132] [2020-10-19 20:23:56,979 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-19 20:23:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:23:57,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-19 20:23:57,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:23:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:23:57,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:23:57,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-19 20:23:57,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142200260] [2020-10-19 20:23:57,048 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:23:57,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:57,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2020-10-19 20:23:57,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:57,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953328471] [2020-10-19 20:23:57,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:57,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:57,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:57,073 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:23:57,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:23:57,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:23:57,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:23:57,121 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-19 20:23:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:23:57,145 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-10-19 20:23:57,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:23:57,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2020-10-19 20:23:57,146 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:23:57,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2020-10-19 20:23:57,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:23:57,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:23:57,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2020-10-19 20:23:57,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:23:57,148 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-10-19 20:23:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2020-10-19 20:23:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-19 20:23:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-19 20:23:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-10-19 20:23:57,153 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-19 20:23:57,153 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-19 20:23:57,153 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:23:57,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2020-10-19 20:23:57,157 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:23:57,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:23:57,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:23:57,158 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-19 20:23:57,158 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:23:57,158 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(20);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 < 5);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 < 5);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 < 5); 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-19 20:23:57,159 INFO L796 eck$LassoCheckResult]: Loop: 326#L20-3 assume !!(max_~i~0 < 5);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~mem5;havoc max_#t~mem4; 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-19 20:23:57,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:57,159 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-10-19 20:23:57,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:57,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819579531] [2020-10-19 20:23:57,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:23:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:23:57,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819579531] [2020-10-19 20:23:57,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160636912] [2020-10-19 20:23:57,226 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-19 20:23:57,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:23:57,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:23:57,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:23:57,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:23:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:23:57,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:23:57,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-19 20:23:57,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685697219] [2020-10-19 20:23:57,286 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:23:57,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:57,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2020-10-19 20:23:57,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:57,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245259759] [2020-10-19 20:23:57,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:57,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:57,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:57,298 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:23:57,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:23:57,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 20:23:57,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-19 20:23:57,337 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2020-10-19 20:23:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:23:57,354 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-10-19 20:23:57,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:23:57,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2020-10-19 20:23:57,356 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:23:57,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2020-10-19 20:23:57,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:23:57,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:23:57,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2020-10-19 20:23:57,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:23:57,357 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-10-19 20:23:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2020-10-19 20:23:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-10-19 20:23:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-19 20:23:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-10-19 20:23:57,360 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-19 20:23:57,360 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-19 20:23:57,360 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:23:57,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2020-10-19 20:23:57,361 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:23:57,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:23:57,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:23:57,361 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-10-19 20:23:57,361 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:23:57,362 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(20);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 < 5);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 < 5);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 < 5);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 < 5); 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-19 20:23:57,362 INFO L796 eck$LassoCheckResult]: Loop: 413#L20-3 assume !!(max_~i~0 < 5);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~mem5;havoc max_#t~mem4; 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-19 20:23:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:57,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-10-19 20:23:57,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:57,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268580406] [2020-10-19 20:23:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:23:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:23:57,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268580406] [2020-10-19 20:23:57,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567575564] [2020-10-19 20:23:57,402 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-19 20:23:57,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-19 20:23:57,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:23:57,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 20:23:57,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:23:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:23:57,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:23:57,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-19 20:23:57,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356304018] [2020-10-19 20:23:57,466 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:23:57,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:57,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2020-10-19 20:23:57,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:57,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036619056] [2020-10-19 20:23:57,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:57,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:57,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:57,477 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:23:57,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:23:57,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 20:23:57,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-19 20:23:57,521 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-10-19 20:23:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:23:57,545 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-10-19 20:23:57,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 20:23:57,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2020-10-19 20:23:57,547 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:23:57,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2020-10-19 20:23:57,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:23:57,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:23:57,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2020-10-19 20:23:57,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:23:57,548 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-10-19 20:23:57,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2020-10-19 20:23:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-10-19 20:23:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-19 20:23:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2020-10-19 20:23:57,551 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-10-19 20:23:57,551 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-10-19 20:23:57,551 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:23:57,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2020-10-19 20:23:57,552 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:23:57,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:23:57,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:23:57,553 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-10-19 20:23:57,553 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:23:57,553 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(20);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 < 5);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 < 5);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 < 5);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 < 5);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 < 5); 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-19 20:23:57,553 INFO L796 eck$LassoCheckResult]: Loop: 511#L20-3 assume !!(max_~i~0 < 5);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~mem5;havoc max_#t~mem4; 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-19 20:23:57,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:57,553 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-10-19 20:23:57,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:57,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524883566] [2020-10-19 20:23:57,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:23:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:23:57,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524883566] [2020-10-19 20:23:57,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585010679] [2020-10-19 20:23:57,612 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-19 20:23:57,662 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-19 20:23:57,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:23:57,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 20:23:57,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:23:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:23:57,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:23:57,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-19 20:23:57,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788318032] [2020-10-19 20:23:57,694 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:23:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:57,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2020-10-19 20:23:57,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:57,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503331952] [2020-10-19 20:23:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:57,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:57,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:57,707 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:23:57,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:23:57,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 20:23:57,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-19 20:23:57,744 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-10-19 20:23:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:23:57,773 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-10-19 20:23:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 20:23:57,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2020-10-19 20:23:57,775 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:23:57,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2020-10-19 20:23:57,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:23:57,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:23:57,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2020-10-19 20:23:57,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:23:57,777 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-19 20:23:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2020-10-19 20:23:57,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-10-19 20:23:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-19 20:23:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2020-10-19 20:23:57,780 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-19 20:23:57,781 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-19 20:23:57,781 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:23:57,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2020-10-19 20:23:57,782 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 20:23:57,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:23:57,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:23:57,783 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-10-19 20:23:57,783 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:23:57,783 INFO L794 eck$LassoCheckResult]: Stem: 635#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); 630#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 631#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 632#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 633#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 634#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 < 5);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 < 5);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 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 640#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 639#L34-3 assume !(main_~i~1 < 5); 629#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; 619#L20-3 [2020-10-19 20:23:57,783 INFO L796 eck$LassoCheckResult]: Loop: 619#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 620#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; 628#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 623#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 619#L20-3 [2020-10-19 20:23:57,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:57,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-10-19 20:23:57,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:57,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705607063] [2020-10-19 20:23:57,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:57,800 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:57,815 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:57,824 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:23:57,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:57,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2020-10-19 20:23:57,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:57,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037635183] [2020-10-19 20:23:57,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:57,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:57,833 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:57,835 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:23:57,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:23:57,836 INFO L82 PathProgramCache]: Analyzing trace with hash -743539014, now seen corresponding path program 1 times [2020-10-19 20:23:57,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:23:57,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298325828] [2020-10-19 20:23:57,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:23:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:57,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:23:57,907 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:23:57,922 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:23:59,137 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 167 DAG size of output: 127 [2020-10-19 20:23:59,327 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-19 20:23:59,330 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:23:59,330 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:23:59,330 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:23:59,330 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:23:59,330 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:23:59,330 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:59,330 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:23:59,330 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:23:59,331 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration7_Lasso [2020-10-19 20:23:59,331 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:23:59,331 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:23:59,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,596 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-10-19 20:23:59,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:23:59,980 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:23:59,981 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:23:59,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:23:59,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:23:59,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:23:59,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:23:59,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:23:59,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:23:59,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:23:59,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:23:59,995 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,028 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:00,058 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:00,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,098 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:00,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,137 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 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,164 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) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:00,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,281 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-19 20:24:00,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:00,310 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-19 20:24:00,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24: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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:00,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:00,431 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,462 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-19 20:24:00,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24: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-19 20:24:00,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:00,604 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-19 20:24:00,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,639 INFO L402 nArgumentSynthesizer]: A total of 0 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-19 20:24:00,640 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-19 20:24:00,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,679 INFO L402 nArgumentSynthesizer]: A total of 2 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-19 20:24:00,687 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-19 20:24:00,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,727 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-19 20:24:00,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:00,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,780 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-19 20:24:00,784 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) [2020-10-19 20:24:00,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-19 20:24:00,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:00,870 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-19 20:24:00,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:00,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:00,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:00,905 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:00,940 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 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:00,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:00,969 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:00,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 Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:00,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:00,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:00,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:00,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:00,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:00,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:00,997 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 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:01,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:01,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:01,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:01,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:01,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:01,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:01,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:01,043 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:24:01,063 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-19 20:24:01,063 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:01,065 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:24:01,067 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:24:01,067 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:24:01,067 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 9 Supporting invariants [] [2020-10-19 20:24:01,117 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-19 20:24:01,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:01,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:24:01,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:01,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:01,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:01,174 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 20:24:01,175 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-19 20:24:01,201 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 7 states. [2020-10-19 20:24:01,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:24:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:24:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-10-19 20:24:01,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 4 letters. [2020-10-19 20:24:01,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:01,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 18 letters. Loop has 4 letters. [2020-10-19 20:24:01,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:01,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 8 letters. [2020-10-19 20:24:01,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:01,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2020-10-19 20:24:01,206 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:01,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 42 transitions. [2020-10-19 20:24:01,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-19 20:24:01,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-19 20:24:01,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2020-10-19 20:24:01,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:01,211 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-10-19 20:24:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2020-10-19 20:24:01,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-19 20:24:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-19 20:24:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2020-10-19 20:24:01,213 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-10-19 20:24:01,214 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-10-19 20:24:01,214 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:24:01,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2020-10-19 20:24:01,216 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:01,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:01,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:01,217 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:01,217 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:01,218 INFO L794 eck$LassoCheckResult]: Stem: 830#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); 829#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 825#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 826#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 827#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 828#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 840#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 839#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 838#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 837#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 836#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 835#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 834#L34-3 assume !(main_~i~1 < 5); 824#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; 813#L20-3 assume !(max_~i~0 < 5); 809#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 810#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; 833#L20-8 [2020-10-19 20:24:01,218 INFO L796 eck$LassoCheckResult]: Loop: 833#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 819#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; 811#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 812#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 833#L20-8 [2020-10-19 20:24:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581251, now seen corresponding path program 1 times [2020-10-19 20:24:01,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293658947] [2020-10-19 20:24:01,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:01,258 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-19 20:24:01,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293658947] [2020-10-19 20:24:01,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:24:01,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:24:01,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51681631] [2020-10-19 20:24:01,260 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2020-10-19 20:24:01,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133026862] [2020-10-19 20:24:01,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,265 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,270 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:01,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:01,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:24:01,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:24:01,309 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-19 20:24:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:01,341 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2020-10-19 20:24:01,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:24:01,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2020-10-19 20:24:01,342 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:01,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2020-10-19 20:24:01,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-19 20:24:01,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-19 20:24:01,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2020-10-19 20:24:01,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:01,343 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2020-10-19 20:24:01,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2020-10-19 20:24:01,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2020-10-19 20:24:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-19 20:24:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2020-10-19 20:24:01,347 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-19 20:24:01,347 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-19 20:24:01,347 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:24:01,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2020-10-19 20:24:01,348 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:01,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:01,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:01,349 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:01,349 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:01,349 INFO L794 eck$LassoCheckResult]: Stem: 915#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); 910#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 911#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 912#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 913#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 914#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 926#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 925#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 924#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 923#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 922#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 921#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 920#L34-3 assume !(main_~i~1 < 5); 909#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; 898#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 899#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 908#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 903#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 900#L20-3 assume !(max_~i~0 < 5); 894#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 895#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; 918#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 904#L21-3 [2020-10-19 20:24:01,349 INFO L796 eck$LassoCheckResult]: Loop: 904#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; 896#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 897#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 919#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 904#L21-3 [2020-10-19 20:24:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1336698829, now seen corresponding path program 1 times [2020-10-19 20:24:01,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581384269] [2020-10-19 20:24:01,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-19 20:24:01,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581384269] [2020-10-19 20:24:01,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693482745] [2020-10-19 20:24:01,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-19 20:24:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:01,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-19 20:24:01,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-19 20:24:01,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:01,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-19 20:24:01,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587729638] [2020-10-19 20:24:01,441 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:01,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2020-10-19 20:24:01,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443112978] [2020-10-19 20:24:01,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,449 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,450 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:01,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:01,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:24:01,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:24:01,509 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-19 20:24:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:01,563 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2020-10-19 20:24:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:24:01,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 70 transitions. [2020-10-19 20:24:01,565 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:01,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 70 transitions. [2020-10-19 20:24:01,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-10-19 20:24:01,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-10-19 20:24:01,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 70 transitions. [2020-10-19 20:24:01,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:01,567 INFO L691 BuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2020-10-19 20:24:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 70 transitions. [2020-10-19 20:24:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2020-10-19 20:24:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-19 20:24:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2020-10-19 20:24:01,570 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-10-19 20:24:01,571 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-10-19 20:24:01,571 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 20:24:01,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2020-10-19 20:24:01,571 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:01,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:01,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:01,573 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:01,573 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:01,573 INFO L794 eck$LassoCheckResult]: Stem: 1080#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); 1075#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1076#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1077#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1078#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1079#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1097#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1096#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1095#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1093#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1091#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1090#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1089#L34-3 assume !(main_~i~1 < 5); 1074#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; 1061#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1062#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1088#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1087#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1063#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1064#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1073#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1067#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1068#L20-3 assume !(max_~i~0 < 5); 1059#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1060#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; 1084#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1094#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1092#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1085#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1083#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1069#L21-3 [2020-10-19 20:24:01,573 INFO L796 eck$LassoCheckResult]: Loop: 1069#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; 1057#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1058#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1086#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1069#L21-3 [2020-10-19 20:24:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1525547091, now seen corresponding path program 1 times [2020-10-19 20:24:01,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119581249] [2020-10-19 20:24:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-19 20:24:01,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119581249] [2020-10-19 20:24:01,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146173827] [2020-10-19 20:24:01,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-19 20:24:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:01,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:24:01,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-19 20:24:01,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:01,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-19 20:24:01,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277650067] [2020-10-19 20:24:01,680 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:01,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2020-10-19 20:24:01,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958208764] [2020-10-19 20:24:01,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,685 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:01,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:01,689 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:01,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:01,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 20:24:01,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-19 20:24:01,766 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-10-19 20:24:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:01,844 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2020-10-19 20:24:01,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:24:01,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2020-10-19 20:24:01,847 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:01,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 85 transitions. [2020-10-19 20:24:01,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-10-19 20:24:01,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-10-19 20:24:01,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 85 transitions. [2020-10-19 20:24:01,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:01,849 INFO L691 BuchiCegarLoop]: Abstraction has 69 states and 85 transitions. [2020-10-19 20:24:01,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 85 transitions. [2020-10-19 20:24:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2020-10-19 20:24:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-19 20:24:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2020-10-19 20:24:01,852 INFO L714 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2020-10-19 20:24:01,852 INFO L594 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2020-10-19 20:24:01,853 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 20:24:01,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 62 transitions. [2020-10-19 20:24:01,853 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:01,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:01,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:01,854 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:01,854 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:01,855 INFO L794 eck$LassoCheckResult]: Stem: 1290#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); 1285#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1286#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1287#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1288#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1289#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1306#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1305#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1304#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1303#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1302#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1301#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1300#L34-3 assume !(main_~i~1 < 5); 1284#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; 1269#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1270#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1307#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1275#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1276#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1308#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1310#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1309#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1271#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1272#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1282#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1283#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1296#L20-3 assume !(max_~i~0 < 5); 1265#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1266#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; 1293#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1277#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1278#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1294#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1295#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1313#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1267#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1268#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1312#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1298#L21-3 [2020-10-19 20:24:01,855 INFO L796 eck$LassoCheckResult]: Loop: 1298#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; 1311#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1299#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1297#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1298#L21-3 [2020-10-19 20:24:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:01,855 INFO L82 PathProgramCache]: Analyzing trace with hash 452444531, now seen corresponding path program 2 times [2020-10-19 20:24:01,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:01,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32478449] [2020-10-19 20:24:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-10-19 20:24:01,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32478449] [2020-10-19 20:24:01,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883764712] [2020-10-19 20:24:01,926 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 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-19 20:24:02,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:24:02,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:02,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 20:24:02,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-10-19 20:24:02,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:02,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-19 20:24:02,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170726562] [2020-10-19 20:24:02,045 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:02,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2020-10-19 20:24:02,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:02,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090716123] [2020-10-19 20:24:02,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:02,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:02,052 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:02,054 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:02,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:02,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 20:24:02,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-19 20:24:02,113 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. cyclomatic complexity: 16 Second operand 7 states. [2020-10-19 20:24:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:02,192 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2020-10-19 20:24:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 20:24:02,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 100 transitions. [2020-10-19 20:24:02,193 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:02,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 100 transitions. [2020-10-19 20:24:02,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-10-19 20:24:02,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-10-19 20:24:02,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 100 transitions. [2020-10-19 20:24:02,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:02,195 INFO L691 BuchiCegarLoop]: Abstraction has 81 states and 100 transitions. [2020-10-19 20:24:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 100 transitions. [2020-10-19 20:24:02,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2020-10-19 20:24:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-19 20:24:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2020-10-19 20:24:02,199 INFO L714 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2020-10-19 20:24:02,199 INFO L594 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2020-10-19 20:24:02,199 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 20:24:02,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 72 transitions. [2020-10-19 20:24:02,200 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:02,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:02,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:02,201 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:02,201 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:02,201 INFO L794 eck$LassoCheckResult]: Stem: 1543#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); 1538#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1539#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1540#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1541#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1542#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1544#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1561#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1560#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1559#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1558#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1556#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1555#L34-3 assume !(main_~i~1 < 5); 1537#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; 1522#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1523#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1535#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1536#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1524#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1525#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1574#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1528#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1529#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1573#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1572#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1571#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1570#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1551#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1563#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1557#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1550#L20-3 assume !(max_~i~0 < 5); 1518#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1519#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; 1547#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1530#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1531#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1548#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1549#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1569#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1520#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1521#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1568#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1567#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1566#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1565#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1564#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1553#L21-3 [2020-10-19 20:24:02,202 INFO L796 eck$LassoCheckResult]: Loop: 1553#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; 1562#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1554#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1552#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1553#L21-3 [2020-10-19 20:24:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:02,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2023971731, now seen corresponding path program 3 times [2020-10-19 20:24:02,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:02,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121009407] [2020-10-19 20:24:02,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-19 20:24:02,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121009407] [2020-10-19 20:24:02,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663228224] [2020-10-19 20:24:02,262 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 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-19 20:24:02,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-19 20:24:02,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:24:02,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 20:24:02,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-19 20:24:02,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:24:02,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-19 20:24:02,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836117910] [2020-10-19 20:24:02,390 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:24:02,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:02,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2020-10-19 20:24:02,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:02,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120125983] [2020-10-19 20:24:02,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:02,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:02,408 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:02,411 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:02,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:02,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 20:24:02,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-19 20:24:02,482 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. cyclomatic complexity: 18 Second operand 8 states. [2020-10-19 20:24:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:02,582 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2020-10-19 20:24:02,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 20:24:02,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 103 transitions. [2020-10-19 20:24:02,584 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:02,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 103 transitions. [2020-10-19 20:24:02,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-10-19 20:24:02,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-10-19 20:24:02,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 103 transitions. [2020-10-19 20:24:02,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:02,587 INFO L691 BuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2020-10-19 20:24:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 103 transitions. [2020-10-19 20:24:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2020-10-19 20:24:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-19 20:24:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2020-10-19 20:24:02,590 INFO L714 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2020-10-19 20:24:02,590 INFO L594 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2020-10-19 20:24:02,590 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 20:24:02,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 82 transitions. [2020-10-19 20:24:02,591 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:24:02,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:02,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:02,593 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:02,593 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:24:02,593 INFO L794 eck$LassoCheckResult]: Stem: 1831#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); 1825#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1826#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1827#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1828#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1829#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1854#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1852#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1850#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1848#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1846#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1844#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1843#L34-3 assume !(main_~i~1 < 5); 1824#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; 1811#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1812#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1830#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1871#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1813#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1814#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1823#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1817#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1818#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1870#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1869#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1868#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1867#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1866#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1865#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1864#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1863#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1838#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1861#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1859#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1837#L20-3 assume !(max_~i~0 < 5); 1807#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1808#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; 1835#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1862#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1860#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1836#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1834#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1819#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1809#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1810#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1858#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1857#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1856#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1855#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1853#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1851#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 1849#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1847#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1845#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1840#L21-3 [2020-10-19 20:24:02,593 INFO L796 eck$LassoCheckResult]: Loop: 1840#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; 1842#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 1841#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 1839#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1840#L21-3 [2020-10-19 20:24:02,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:02,594 INFO L82 PathProgramCache]: Analyzing trace with hash 669208243, now seen corresponding path program 4 times [2020-10-19 20:24:02,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:02,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490408749] [2020-10-19 20:24:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:02,629 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:02,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:02,671 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:02,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:02,672 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2020-10-19 20:24:02,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:02,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171242334] [2020-10-19 20:24:02,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:02,678 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:02,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:02,681 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:02,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:02,682 INFO L82 PathProgramCache]: Analyzing trace with hash -746698386, now seen corresponding path program 1 times [2020-10-19 20:24:02,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:02,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345060137] [2020-10-19 20:24:02,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-10-19 20:24:02,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345060137] [2020-10-19 20:24:02,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080370549] [2020-10-19 20:24:02,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-19 20:24:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:02,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 20:24:02,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-10-19 20:24:02,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 20:24:02,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2020-10-19 20:24:02,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606230737] [2020-10-19 20:24:02,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:24:02,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 20:24:02,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-10-19 20:24:02,931 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. cyclomatic complexity: 20 Second operand 8 states. [2020-10-19 20:24:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:24:03,074 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2020-10-19 20:24:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 20:24:03,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 100 transitions. [2020-10-19 20:24:03,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 20:24:03,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 62 states and 73 transitions. [2020-10-19 20:24:03,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-10-19 20:24:03,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-10-19 20:24:03,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2020-10-19 20:24:03,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:03,078 INFO L691 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2020-10-19 20:24:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2020-10-19 20:24:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-19 20:24:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-19 20:24:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2020-10-19 20:24:03,109 INFO L714 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2020-10-19 20:24:03,109 INFO L594 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2020-10-19 20:24:03,109 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-19 20:24:03,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2020-10-19 20:24:03,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 20:24:03,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:24:03,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:24:03,116 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:24:03,116 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:24:03,116 INFO L794 eck$LassoCheckResult]: Stem: 2159#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); 2154#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2155#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2156#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2157#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2158#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2179#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2176#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2173#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 2170#L34-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 2168#L34-3 assume !!(main_~i~1 < 5);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; 2165#L34-3 assume !(main_~i~1 < 5); 2153#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; 2145#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2146#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2152#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2147#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2148#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2202#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2201#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2200#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2198#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2196#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2194#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2192#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2190#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2188#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2186#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2183#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2181#L20-3 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2178#L21 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2175#L21-2 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2172#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2164#L20-3 assume !(max_~i~0 < 5); 2141#L20-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2142#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; 2162#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2149#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2143#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2144#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2163#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2199#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2197#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2195#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2193#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2191#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2189#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2187#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2185#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2184#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2182#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2180#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2177#L20-8 assume !!(max_~i~0 < 5);call max_#t~mem4 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2174#L21-3 assume !(max_~ret~0 < max_#t~mem4);max_#t~ite6 := max_~ret~0; 2171#L21-5 max_~ret~0 := max_#t~ite6;havoc max_#t~ite6;havoc max_#t~mem5;havoc max_#t~mem4; 2169#L20-7 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 2167#L20-8 assume !(max_~i~0 < 5); 2160#L20-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2161#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; 2150#L43-3 [2020-10-19 20:24:03,117 INFO L796 eck$LassoCheckResult]: Loop: 2150#L43-3 assume !!(main_~i~2 < 4);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; 2151#L43-2 main_#t~post14 := main_~i~2;main_~i~2 := 1 + main_#t~post14;havoc main_#t~post14; 2150#L43-3 [2020-10-19 20:24:03,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:03,117 INFO L82 PathProgramCache]: Analyzing trace with hash -260352212, now seen corresponding path program 1 times [2020-10-19 20:24:03,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:03,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167575194] [2020-10-19 20:24:03,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,169 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,201 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,216 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:03,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:03,216 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2020-10-19 20:24:03,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:03,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147158574] [2020-10-19 20:24:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,220 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,222 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,226 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:03,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:03,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1090370322, now seen corresponding path program 1 times [2020-10-19 20:24:03,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:24:03,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237497531] [2020-10-19 20:24:03,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:24:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,293 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:24:03,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:24:03,343 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:24:07,688 WARN L193 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 433 DAG size of output: 314 [2020-10-19 20:24:08,602 WARN L193 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 140 [2020-10-19 20:24:08,608 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:24:08,608 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:24:08,608 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:24:08,608 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:24:08,608 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:24:08,608 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:08,609 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:24:08,609 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:24:08,609 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration14_Lasso [2020-10-19 20:24:08,609 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:24:08,609 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:24:08,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:08,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:08,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:08,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:08,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:08,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:08,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:08,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:08,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,193 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2020-10-19 20:24:09,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,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-19 20:24:09,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:24:09,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-19 20:24:09,825 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:24:09,826 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:09,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:09,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:09,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:09,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:09,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:09,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:09,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:09,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:09,834 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 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-19 20:24:09,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:09,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:09,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:09,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:09,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:09,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:09,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:09,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:09,858 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) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:09,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:09,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:09,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:09,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:09,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:09,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:09,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:09,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:09,884 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-19 20:24:09,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:09,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:09,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:09,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:09,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:09,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:09,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:09,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:09,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:24:09,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:09,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:09,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:09,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:09,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:09,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:09,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:09,955 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-19 20:24:09,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:09,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:09,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:09,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:09,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:09,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:09,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:09,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:09,995 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-19 20:24:10,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:10,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:10,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:10,022 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-19 20:24:10,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:10,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:24:10,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:24:10,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:24:10,047 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-19 20:24:10,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:10,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:10,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:10,077 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-19 20:24:10,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:10,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:10,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:10,116 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-19 20:24:10,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:24:10,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:24:10,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:24:10,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:24:10,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:24:10,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:24:10,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:24:10,161 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:24:10,197 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-19 20:24:10,198 INFO L444 ModelExtractionUtils]: 1 out of 22 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 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:24:10,200 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:24:10,202 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:24:10,202 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:24:10,203 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3, ULTIMATE.start_main_~i~2) = 7*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 - 16*ULTIMATE.start_main_~i~2 Supporting invariants [] [2020-10-19 20:24:10,358 INFO L297 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2020-10-19 20:24:10,360 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:24:10,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:24:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:10,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:24:10,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:24:10,438 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 20:24:10,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:24:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:24:10,458 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 20:24:10,458 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-19 20:24:10,468 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 64 states and 76 transitions. Complement of second has 4 states. [2020-10-19 20:24:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 20:24:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:24:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2020-10-19 20:24:10,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 2 letters. [2020-10-19 20:24:10,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:10,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 62 letters. Loop has 2 letters. [2020-10-19 20:24:10,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:10,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 4 letters. [2020-10-19 20:24:10,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:24:10,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2020-10-19 20:24:10,472 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:24:10,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2020-10-19 20:24:10,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 20:24:10,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 20:24:10,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 20:24:10,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:24:10,473 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:24:10,473 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:24:10,473 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:24:10,473 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-19 20:24:10,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 20:24:10,473 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:24:10,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 20:24:10,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 08:24:10 BoogieIcfgContainer [2020-10-19 20:24:10,480 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 20:24:10,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 20:24:10,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 20:24:10,481 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 20:24:10,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:23:53" (3/4) ... [2020-10-19 20:24:10,485 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 20:24:10,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 20:24:10,487 INFO L168 Benchmark]: Toolchain (without parser) took 17490.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 377.0 MB). Free memory was 958.6 MB in the beginning and 984.5 MB in the end (delta: -25.9 MB). Peak memory consumption was 351.1 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:10,487 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:24:10,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 958.6 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:10,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:10,488 INFO L168 Benchmark]: Boogie Preprocessor took 30.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:24:10,488 INFO L168 Benchmark]: RCFGBuilder took 397.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:10,489 INFO L168 Benchmark]: BuchiAutomizer took 16641.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 237.0 MB). Free memory was 1.1 GB in the beginning and 984.5 MB in the end (delta: 118.2 MB). Peak memory consumption was 355.1 MB. Max. memory is 11.5 GB. [2020-10-19 20:24:10,489 INFO L168 Benchmark]: Witness Printer took 4.64 ms. Allocated memory is still 1.4 GB. Free memory is still 984.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:24:10,491 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 958.6 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 397.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16641.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 237.0 MB). Free memory was 1.1 GB in the beginning and 984.5 MB in the end (delta: 118.2 MB). Peak memory consumption was 355.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.64 ms. Allocated memory is still 1.4 GB. Free memory is still 984.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function 7 * unknown-#length-unknown[x] + -16 * i and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.5s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 15.2s. Construction of modules took 0.4s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 85 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 353 SDtfs, 376 SDslu, 690 SDs, 0 SdLazy, 415 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital263 mio100 ax100 hnf99 lsp95 ukn53 mio100 lsp45 div100 bol100 ite100 ukn100 eq172 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms 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...