./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 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/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.2.0-5485861 [2020-10-26 06:00:27,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 06:00:27,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 06:00:27,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 06:00:27,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 06:00:27,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 06:00:27,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 06:00:27,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 06:00:27,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 06:00:27,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 06:00:27,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 06:00:27,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 06:00:27,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 06:00:27,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 06:00:27,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 06:00:27,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 06:00:27,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 06:00:27,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 06:00:27,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 06:00:27,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 06:00:27,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 06:00:27,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 06:00:27,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 06:00:27,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 06:00:27,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 06:00:27,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 06:00:27,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 06:00:27,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 06:00:27,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 06:00:27,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 06:00:27,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 06:00:27,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 06:00:27,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 06:00:27,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 06:00:27,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 06:00:27,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 06:00:27,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 06:00:27,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 06:00:27,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 06:00:27,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 06:00:27,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 06:00:27,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 06:00:27,255 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 06:00:27,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 06:00:27,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 06:00:27,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 06:00:27,258 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 06:00:27,258 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 06:00:27,258 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 06:00:27,258 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 06:00:27,259 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 06:00:27,259 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 06:00:27,259 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 06:00:27,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 06:00:27,259 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 06:00:27,260 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 06:00:27,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 06:00:27,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 06:00:27,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 06:00:27,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 06:00:27,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 06:00:27,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 06:00:27,261 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 06:00:27,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 06:00:27,262 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 06:00:27,262 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 06:00:27,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 06:00:27,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 06:00:27,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 06:00:27,263 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 06:00:27,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 06:00:27,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 06:00:27,263 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 06:00:27,264 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 06:00:27,265 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 06:00:27,265 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ae365f36af85d643f41b38559013209b3bcedb0 [2020-10-26 06:00:27,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 06:00:27,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 06:00:27,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 06:00:27,742 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 06:00:27,745 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 06:00:27,746 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-26 06:00:27,830 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c7728659/055627440d6948d2b932583008ce8adc/FLAG4a18e12f6 [2020-10-26 06:00:28,545 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 06:00:28,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i [2020-10-26 06:00:28,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c7728659/055627440d6948d2b932583008ce8adc/FLAG4a18e12f6 [2020-10-26 06:00:28,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c7728659/055627440d6948d2b932583008ce8adc [2020-10-26 06:00:28,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 06:00:28,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 06:00:28,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 06:00:28,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 06:00:28,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 06:00:28,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:00:28" (1/1) ... [2020-10-26 06:00:28,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3ece3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:28, skipping insertion in model container [2020-10-26 06:00:28,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:00:28" (1/1) ... [2020-10-26 06:00:28,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 06:00:28,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 06:00:29,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 06:00:29,221 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 06:00:29,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 06:00:29,270 INFO L208 MainTranslator]: Completed translation [2020-10-26 06:00:29,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:29 WrapperNode [2020-10-26 06:00:29,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 06:00:29,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 06:00:29,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 06:00:29,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 06:00:29,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:29" (1/1) ... [2020-10-26 06:00:29,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:29" (1/1) ... [2020-10-26 06:00:29,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 06:00:29,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 06:00:29,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 06:00:29,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 06:00:29,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:29" (1/1) ... [2020-10-26 06:00:29,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:29" (1/1) ... [2020-10-26 06:00:29,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:29" (1/1) ... [2020-10-26 06:00:29,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:29" (1/1) ... [2020-10-26 06:00:29,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:29" (1/1) ... [2020-10-26 06:00:29,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:29" (1/1) ... [2020-10-26 06:00:29,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:29" (1/1) ... [2020-10-26 06:00:29,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 06:00:29,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 06:00:29,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 06:00:29,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 06:00:29,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:29,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 06:00:29,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 06:00:29,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 06:00:29,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 06:00:29,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 06:00:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 06:00:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 06:00:30,314 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 06:00:30,315 INFO L298 CfgBuilder]: Removed 17 assume(true) statements. [2020-10-26 06:00:30,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:00:30 BoogieIcfgContainer [2020-10-26 06:00:30,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 06:00:30,322 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 06:00:30,322 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 06:00:30,326 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 06:00:30,327 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:00:30,327 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 06:00:28" (1/3) ... [2020-10-26 06:00:30,329 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15496150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 06:00:30, skipping insertion in model container [2020-10-26 06:00:30,329 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:00:30,329 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:00:29" (2/3) ... [2020-10-26 06:00:30,330 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15496150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 06:00:30, skipping insertion in model container [2020-10-26 06:00:30,330 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:00:30,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:00:30" (3/3) ... [2020-10-26 06:00:30,335 INFO L373 chiAutomizerObserver]: Analyzing ICFG max05-1.i [2020-10-26 06:00:30,407 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 06:00:30,407 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 06:00:30,407 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 06:00:30,408 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 06:00:30,408 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 06:00:30,408 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 06:00:30,408 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 06:00:30,408 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 06:00:30,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-10-26 06:00:30,464 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-10-26 06:00:30,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:30,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:30,472 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 06:00:30,472 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:00:30,472 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 06:00:30,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-10-26 06:00:30,476 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-10-26 06:00:30,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:30,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:30,477 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 06:00:30,477 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:00:30,485 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-26 06:00:30,486 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-26 06:00:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:30,493 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-26 06:00:30,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:30,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942307029] [2020-10-26 06:00:30,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:30,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:30,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:30,689 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:30,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:30,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-26 06:00:30,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:30,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555546180] [2020-10-26 06:00:30,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:30,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:30,708 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:30,711 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:30,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:30,714 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-26 06:00:30,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:30,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845098806] [2020-10-26 06:00:30,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:30,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:30,764 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:30,769 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:31,212 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-10-26 06:00:31,366 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-26 06:00:31,386 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:00:31,387 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:00:31,387 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:00:31,388 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:00:31,388 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:00:31,388 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:31,388 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:00:31,388 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:00:31,389 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration1_Lasso [2020-10-26 06:00:31,389 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:00:31,390 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:00:31,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,742 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-10-26 06:00:31,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:31,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:32,227 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:00:32,233 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-26 06:00:32,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:32,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:32,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:32,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:32,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:32,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:32,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:32,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:32,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:32,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:32,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:32,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:32,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:32,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:32,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:32,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:32,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:32,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:32,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:32,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:32,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:32,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,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-26 06:00:32,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:32,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:32,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,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-26 06:00:32,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:32,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:32,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:32,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:32,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:32,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:32,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:32,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:32,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:32,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:32,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:32,704 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-26 06:00:32,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:32,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:32,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:32,748 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) [2020-10-26 06:00:32,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:32,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:32,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:32,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:32,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:32,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:32,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:32,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:32,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:32,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:32,939 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-26 06:00:32,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:32,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:32,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:32,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:32,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:32,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:32,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:32,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:32,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:33,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:33,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:33,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:33,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:33,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:33,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:33,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:33,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:33,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:33,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:33,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:33,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:33,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:33,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:33,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:33,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:33,154 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:33,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:33,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:33,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:33,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:33,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:33,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:33,171 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:33,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:33,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:33,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:33,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:33,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:33,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:33,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:33,215 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-26 06:00:33,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:33,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:33,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:33,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:33,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:33,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:33,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:33,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:33,246 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-26 06:00:33,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:33,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:33,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:33,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:33,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:33,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:33,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:33,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 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-26 06:00:33,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:33,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:33,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:33,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:33,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:33,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:33,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:33,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:33,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:33,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:33,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:33,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:33,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:33,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:33,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:33,407 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:00:33,458 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-26 06:00:33,458 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-26 06:00:33,468 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:33,471 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:00:33,472 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:00:33,473 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-26 06:00:33,535 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-26 06:00:33,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 06:00:33,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:33,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 06:00:33,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:33,647 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 06:00:33,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:33,706 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 06:00:33,708 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states. Second operand 3 states. [2020-10-26 06:00:33,837 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states.. Second operand 3 states. Result 87 states and 124 transitions. Complement of second has 8 states. [2020-10-26 06:00:33,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 06:00:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 06:00:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2020-10-26 06:00:33,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-26 06:00:33,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:33,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-26 06:00:33,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:33,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-26 06:00:33,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:33,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 124 transitions. [2020-10-26 06:00:33,852 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:33,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 25 states and 33 transitions. [2020-10-26 06:00:33,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-26 06:00:33,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:33,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2020-10-26 06:00:33,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:33,861 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-26 06:00:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2020-10-26 06:00:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-26 06:00:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-26 06:00:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-10-26 06:00:33,894 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-26 06:00:33,894 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-26 06:00:33,895 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 06:00:33,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2020-10-26 06:00:33,896 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:33,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:33,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:33,897 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 06:00:33,897 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:33,897 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-26 06:00:33,898 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 198#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 193#L20-3 [2020-10-26 06:00:33,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:33,898 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-10-26 06:00:33,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:33,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188069736] [2020-10-26 06:00:33,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:33,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188069736] [2020-10-26 06:00:33,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:00:33,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 06:00:33,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733649357] [2020-10-26 06:00:33,997 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:33,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:33,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2020-10-26 06:00:33,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:33,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944142620] [2020-10-26 06:00:33,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:34,015 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:34,033 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:34,040 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:34,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:34,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 06:00:34,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 06:00:34,110 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-26 06:00:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:34,128 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-10-26 06:00:34,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 06:00:34,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2020-10-26 06:00:34,131 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:34,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2020-10-26 06:00:34,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:34,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:34,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2020-10-26 06:00:34,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:34,140 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-10-26 06:00:34,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2020-10-26 06:00:34,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-10-26 06:00:34,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-26 06:00:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-26 06:00:34,144 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-26 06:00:34,144 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-26 06:00:34,144 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 06:00:34,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2020-10-26 06:00:34,145 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:34,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:34,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:34,146 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-26 06:00:34,146 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:34,147 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-26 06:00:34,147 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 254#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 250#L20-3 [2020-10-26 06:00:34,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:34,148 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-10-26 06:00:34,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:34,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861262203] [2020-10-26 06:00:34,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:34,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861262203] [2020-10-26 06:00:34,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202138658] [2020-10-26 06:00:34,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:00:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:34,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-26 06:00:34,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:34,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:34,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-26 06:00:34,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762999365] [2020-10-26 06:00:34,282 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:34,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:34,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2020-10-26 06:00:34,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:34,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590895297] [2020-10-26 06:00:34,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:34,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:34,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:34,309 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:34,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:34,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 06:00:34,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 06:00:34,376 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-26 06:00:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:34,400 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-10-26 06:00:34,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 06:00:34,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2020-10-26 06:00:34,402 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:34,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2020-10-26 06:00:34,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:34,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:34,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2020-10-26 06:00:34,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:34,404 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-10-26 06:00:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2020-10-26 06:00:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-26 06:00:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-26 06:00:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-10-26 06:00:34,408 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-26 06:00:34,408 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-26 06:00:34,408 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 06:00:34,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2020-10-26 06:00:34,409 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:34,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:34,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:34,410 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-26 06:00:34,410 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:34,410 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-26 06:00:34,411 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 330#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 326#L20-3 [2020-10-26 06:00:34,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:34,411 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-10-26 06:00:34,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:34,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794325607] [2020-10-26 06:00:34,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:34,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794325607] [2020-10-26 06:00:34,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295401376] [2020-10-26 06:00:34,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:00:34,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 06:00:34,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:00:34,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:00:34,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:34,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:34,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-26 06:00:34,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660800063] [2020-10-26 06:00:34,541 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:34,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:34,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2020-10-26 06:00:34,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:34,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237439606] [2020-10-26 06:00:34,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:34,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:34,554 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:34,556 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:34,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:34,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 06:00:34,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-26 06:00:34,619 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2020-10-26 06:00:34,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:34,646 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-10-26 06:00:34,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 06:00:34,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2020-10-26 06:00:34,647 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:34,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2020-10-26 06:00:34,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:34,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:34,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2020-10-26 06:00:34,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:34,649 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-10-26 06:00:34,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2020-10-26 06:00:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-10-26 06:00:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-26 06:00:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-10-26 06:00:34,652 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-26 06:00:34,653 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-26 06:00:34,653 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 06:00:34,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2020-10-26 06:00:34,653 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:34,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:34,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:34,654 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-10-26 06:00:34,654 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:34,655 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-26 06:00:34,655 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 417#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 413#L20-3 [2020-10-26 06:00:34,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:34,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-10-26 06:00:34,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:34,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803333291] [2020-10-26 06:00:34,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:34,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803333291] [2020-10-26 06:00:34,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734520007] [2020-10-26 06:00:34,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:00:34,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-26 06:00:34,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:00:34,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 06:00:34,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:34,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:34,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-26 06:00:34,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713635806] [2020-10-26 06:00:34,792 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:34,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:34,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2020-10-26 06:00:34,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:34,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784994499] [2020-10-26 06:00:34,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:34,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:34,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:34,805 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:34,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:34,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 06:00:34,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-26 06:00:34,868 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-10-26 06:00:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:34,897 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-10-26 06:00:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 06:00:34,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2020-10-26 06:00:34,898 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:34,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2020-10-26 06:00:34,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:34,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:34,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2020-10-26 06:00:34,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:34,900 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-10-26 06:00:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2020-10-26 06:00:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-10-26 06:00:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-26 06:00:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2020-10-26 06:00:34,903 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-10-26 06:00:34,903 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-10-26 06:00:34,903 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 06:00:34,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2020-10-26 06:00:34,903 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:34,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:34,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:34,904 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-10-26 06:00:34,904 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:34,904 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-26 06:00:34,905 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 515#L20-2 max_#t~post3 := max_~i~0;max_~i~0 := 1 + max_#t~post3;havoc max_#t~post3; 511#L20-3 [2020-10-26 06:00:34,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:34,905 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-10-26 06:00:34,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:34,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519925357] [2020-10-26 06:00:34,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:34,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519925357] [2020-10-26 06:00:34,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903975275] [2020-10-26 06:00:34,980 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:00:35,035 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-26 06:00:35,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:00:35,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 06:00:35,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:35,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:35,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-26 06:00:35,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377598975] [2020-10-26 06:00:35,080 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:35,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2020-10-26 06:00:35,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:35,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417808573] [2020-10-26 06:00:35,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:35,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:35,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:35,105 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:35,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:35,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 06:00:35,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-26 06:00:35,160 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-10-26 06:00:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:35,213 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-10-26 06:00:35,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 06:00:35,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2020-10-26 06:00:35,216 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:35,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2020-10-26 06:00:35,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 06:00:35,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 06:00:35,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2020-10-26 06:00:35,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:35,217 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-26 06:00:35,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2020-10-26 06:00:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-10-26 06:00:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-26 06:00:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2020-10-26 06:00:35,220 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-26 06:00:35,220 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-26 06:00:35,221 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 06:00:35,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2020-10-26 06:00:35,221 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 06:00:35,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:35,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:35,222 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-10-26 06:00:35,222 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:35,222 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-26 06:00:35,222 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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-26 06:00:35,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:35,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-10-26 06:00:35,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:35,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40751535] [2020-10-26 06:00:35,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:35,260 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:35,291 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:35,300 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:35,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2020-10-26 06:00:35,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:35,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961288698] [2020-10-26 06:00:35,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:35,320 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:35,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:35,331 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:35,333 INFO L82 PathProgramCache]: Analyzing trace with hash -743539014, now seen corresponding path program 1 times [2020-10-26 06:00:35,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:35,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327272794] [2020-10-26 06:00:35,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:35,381 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:35,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:35,404 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:36,702 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 167 DAG size of output: 127 [2020-10-26 06:00:36,913 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-26 06:00:36,918 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:00:36,918 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:00:36,918 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:00:36,918 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:00:36,918 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:00:36,918 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:36,919 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:00:36,919 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:00:36,919 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration7_Lasso [2020-10-26 06:00:36,919 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:00:36,919 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:00:36,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:36,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:37,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:37,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:37,270 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-10-26 06:00:37,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:37,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:37,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:37,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:37,811 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:00:37,812 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) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:37,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:37,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:37,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:37,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:37,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:37,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:37,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:37,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:37,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 06:00:37,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:37,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:37,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:37,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:37,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:37,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:37,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:37,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:37,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 06:00:37,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:37,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:37,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:37,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:37,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:37,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:37,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:37,894 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) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:37,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-26 06:00:37,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:37,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:37,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:37,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:37,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:37,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:37,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:37,933 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-26 06:00:37,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:37,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:37,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:37,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:37,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:37,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:37,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:37,977 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-26 06:00:37,979 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) [2020-10-26 06:00:38,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-26 06:00:38,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,025 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-26 06:00:38,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:38,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:38,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:38,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:38,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:38,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:38,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:38,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:38,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,255 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) [2020-10-26 06:00:38,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:38,341 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-26 06:00:38,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:38,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:38,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:38,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:38,529 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-26 06:00:38,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:38,567 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-26 06:00:38,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-26 06:00:38,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:38,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:38,613 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) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,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-26 06:00:38,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:38,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) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:38,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:38,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:38,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:38,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:38,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:38,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,776 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-26 06:00:38,812 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:38,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:38,820 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-26 06:00:38,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:38,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:38,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:38,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:38,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:38,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:38,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 06:00:38,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:38,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:38,923 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-26 06:00:38,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:38,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:38,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:38,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:38,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:38,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:38,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:38,957 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-26 06:00:38,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:39,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:39,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:39,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:39,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:39,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:39,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:39,006 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) [2020-10-26 06:00:39,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-26 06:00:39,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:39,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:39,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:39,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:39,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:39,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:39,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:00:39,092 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-26 06:00:39,092 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-26 06:00:39,098 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 06:00:39,100 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:00:39,101 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:00:39,101 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-26 06:00:39,167 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-26 06:00:39,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:39,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 06:00:39,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:39,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:00:39,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:39,262 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 06:00:39,263 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-26 06:00:39,290 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-26 06:00:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 06:00:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 06:00:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-10-26 06:00:39,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 4 letters. [2020-10-26 06:00:39,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:39,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 18 letters. Loop has 4 letters. [2020-10-26 06:00:39,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:39,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 8 letters. [2020-10-26 06:00:39,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:39,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2020-10-26 06:00:39,294 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:00:39,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 42 transitions. [2020-10-26 06:00:39,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-26 06:00:39,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-26 06:00:39,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2020-10-26 06:00:39,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:39,297 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-10-26 06:00:39,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2020-10-26 06:00:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-26 06:00:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-26 06:00:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2020-10-26 06:00:39,305 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-10-26 06:00:39,305 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-10-26 06:00:39,305 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 06:00:39,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2020-10-26 06:00:39,306 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:00:39,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:39,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:39,307 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:00:39,308 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:39,309 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-26 06:00:39,309 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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-26 06:00:39,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:39,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581251, now seen corresponding path program 1 times [2020-10-26 06:00:39,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:39,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719445291] [2020-10-26 06:00:39,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:39,388 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-26 06:00:39,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719445291] [2020-10-26 06:00:39,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:00:39,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 06:00:39,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524082117] [2020-10-26 06:00:39,390 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:39,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:39,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2020-10-26 06:00:39,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:39,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767719509] [2020-10-26 06:00:39,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:39,396 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:39,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:39,406 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:39,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:39,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 06:00:39,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 06:00:39,457 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-26 06:00:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:39,501 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2020-10-26 06:00:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 06:00:39,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2020-10-26 06:00:39,503 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:00:39,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2020-10-26 06:00:39,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-26 06:00:39,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-26 06:00:39,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2020-10-26 06:00:39,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:39,507 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2020-10-26 06:00:39,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2020-10-26 06:00:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2020-10-26 06:00:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-26 06:00:39,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2020-10-26 06:00:39,511 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-26 06:00:39,511 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-26 06:00:39,511 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 06:00:39,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2020-10-26 06:00:39,512 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:00:39,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:39,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:39,513 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:00:39,516 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:39,517 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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-26 06:00:39,517 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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-26 06:00:39,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:39,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1336698829, now seen corresponding path program 1 times [2020-10-26 06:00:39,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:39,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039997043] [2020-10-26 06:00:39,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:39,571 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-26 06:00:39,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039997043] [2020-10-26 06:00:39,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136596019] [2020-10-26 06:00:39,572 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-26 06:00:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:39,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-26 06:00:39,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:39,650 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-26 06:00:39,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:39,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-26 06:00:39,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247030439] [2020-10-26 06:00:39,651 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:39,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:39,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2020-10-26 06:00:39,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:39,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100642957] [2020-10-26 06:00:39,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:39,658 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:39,661 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:39,663 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:39,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:39,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 06:00:39,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 06:00:39,747 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-26 06:00:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:39,818 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2020-10-26 06:00:39,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 06:00:39,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 70 transitions. [2020-10-26 06:00:39,820 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:00:39,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 70 transitions. [2020-10-26 06:00:39,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-10-26 06:00:39,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-10-26 06:00:39,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 70 transitions. [2020-10-26 06:00:39,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:39,822 INFO L691 BuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2020-10-26 06:00:39,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 70 transitions. [2020-10-26 06:00:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2020-10-26 06:00:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-26 06:00:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2020-10-26 06:00:39,826 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-10-26 06:00:39,826 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-10-26 06:00:39,826 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-26 06:00:39,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2020-10-26 06:00:39,827 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:00:39,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:39,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:39,828 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-26 06:00:39,828 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:39,828 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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-26 06:00:39,829 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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-26 06:00:39,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:39,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1525547091, now seen corresponding path program 1 times [2020-10-26 06:00:39,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:39,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890735278] [2020-10-26 06:00:39,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:39,879 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-26 06:00:39,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890735278] [2020-10-26 06:00:39,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106111178] [2020-10-26 06:00:39,880 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-26 06:00:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:39,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:00:39,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:39,978 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-26 06:00:39,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:39,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-26 06:00:39,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509043128] [2020-10-26 06:00:39,979 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:39,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:39,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2020-10-26 06:00:39,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:39,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888442735] [2020-10-26 06:00:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:39,985 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:39,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:39,990 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:40,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:40,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 06:00:40,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-26 06:00:40,072 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-10-26 06:00:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:40,182 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2020-10-26 06:00:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 06:00:40,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2020-10-26 06:00:40,185 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:00:40,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 85 transitions. [2020-10-26 06:00:40,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-10-26 06:00:40,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-10-26 06:00:40,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 85 transitions. [2020-10-26 06:00:40,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:40,187 INFO L691 BuchiCegarLoop]: Abstraction has 69 states and 85 transitions. [2020-10-26 06:00:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 85 transitions. [2020-10-26 06:00:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2020-10-26 06:00:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-26 06:00:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2020-10-26 06:00:40,193 INFO L714 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2020-10-26 06:00:40,193 INFO L594 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2020-10-26 06:00:40,193 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-26 06:00:40,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 62 transitions. [2020-10-26 06:00:40,193 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:00:40,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:40,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:40,195 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-26 06:00:40,195 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:40,195 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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-26 06:00:40,195 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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-26 06:00:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:40,196 INFO L82 PathProgramCache]: Analyzing trace with hash 452444531, now seen corresponding path program 2 times [2020-10-26 06:00:40,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:40,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226003400] [2020-10-26 06:00:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:40,250 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-26 06:00:40,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226003400] [2020-10-26 06:00:40,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765826973] [2020-10-26 06:00:40,251 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-26 06:00:40,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 06:00:40,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:00:40,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 06:00:40,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:40,347 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-26 06:00:40,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:40,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-26 06:00:40,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125109162] [2020-10-26 06:00:40,349 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:40,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:40,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2020-10-26 06:00:40,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:40,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024062451] [2020-10-26 06:00:40,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:40,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:40,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:40,366 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:40,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:40,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 06:00:40,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-26 06:00:40,457 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. cyclomatic complexity: 16 Second operand 7 states. [2020-10-26 06:00:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:40,579 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2020-10-26 06:00:40,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 06:00:40,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 100 transitions. [2020-10-26 06:00:40,582 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:00:40,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 100 transitions. [2020-10-26 06:00:40,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-10-26 06:00:40,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-10-26 06:00:40,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 100 transitions. [2020-10-26 06:00:40,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:40,585 INFO L691 BuchiCegarLoop]: Abstraction has 81 states and 100 transitions. [2020-10-26 06:00:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 100 transitions. [2020-10-26 06:00:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2020-10-26 06:00:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-26 06:00:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2020-10-26 06:00:40,590 INFO L714 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2020-10-26 06:00:40,590 INFO L594 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2020-10-26 06:00:40,590 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-26 06:00:40,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 72 transitions. [2020-10-26 06:00:40,591 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:00:40,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:40,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:40,592 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-26 06:00:40,593 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:40,593 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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-26 06:00:40,593 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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-26 06:00:40,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:40,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2023971731, now seen corresponding path program 3 times [2020-10-26 06:00:40,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:40,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684080701] [2020-10-26 06:00:40,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:40,694 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-26 06:00:40,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684080701] [2020-10-26 06:00:40,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047316062] [2020-10-26 06:00:40,695 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-26 06:00:40,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-26 06:00:40,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:00:40,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 06:00:40,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:40,863 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-26 06:00:40,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:00:40,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-26 06:00:40,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607172614] [2020-10-26 06:00:40,864 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:00:40,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:40,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2020-10-26 06:00:40,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:40,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723415802] [2020-10-26 06:00:40,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:40,870 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:40,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:40,876 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:40,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:40,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 06:00:40,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-26 06:00:40,976 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. cyclomatic complexity: 18 Second operand 8 states. [2020-10-26 06:00:41,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:41,117 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2020-10-26 06:00:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 06:00:41,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 103 transitions. [2020-10-26 06:00:41,119 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:00:41,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 103 transitions. [2020-10-26 06:00:41,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-10-26 06:00:41,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-10-26 06:00:41,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 103 transitions. [2020-10-26 06:00:41,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:41,122 INFO L691 BuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2020-10-26 06:00:41,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 103 transitions. [2020-10-26 06:00:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2020-10-26 06:00:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-26 06:00:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2020-10-26 06:00:41,132 INFO L714 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2020-10-26 06:00:41,132 INFO L594 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2020-10-26 06:00:41,132 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-26 06:00:41,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 82 transitions. [2020-10-26 06:00:41,136 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-26 06:00:41,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:41,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:41,140 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-26 06:00:41,140 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 06:00:41,140 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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-26 06:00:41,140 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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-26 06:00:41,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:41,141 INFO L82 PathProgramCache]: Analyzing trace with hash 669208243, now seen corresponding path program 4 times [2020-10-26 06:00:41,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:41,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003839634] [2020-10-26 06:00:41,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:41,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:41,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:41,321 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:41,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2020-10-26 06:00:41,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:41,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974531863] [2020-10-26 06:00:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:41,330 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:41,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:41,337 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:41,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:41,338 INFO L82 PathProgramCache]: Analyzing trace with hash -746698386, now seen corresponding path program 1 times [2020-10-26 06:00:41,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:41,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171470302] [2020-10-26 06:00:41,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:41,471 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-26 06:00:41,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171470302] [2020-10-26 06:00:41,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773125472] [2020-10-26 06:00:41,472 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-26 06:00:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:41,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 06:00:41,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:41,594 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-26 06:00:41,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-26 06:00:41,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2020-10-26 06:00:41,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126115325] [2020-10-26 06:00:41,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:00:41,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 06:00:41,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-10-26 06:00:41,673 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. cyclomatic complexity: 20 Second operand 8 states. [2020-10-26 06:00:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:00:41,824 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2020-10-26 06:00:41,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 06:00:41,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 100 transitions. [2020-10-26 06:00:41,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:00:41,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 62 states and 73 transitions. [2020-10-26 06:00:41,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-10-26 06:00:41,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-10-26 06:00:41,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2020-10-26 06:00:41,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:41,829 INFO L691 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2020-10-26 06:00:41,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2020-10-26 06:00:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-26 06:00:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-26 06:00:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2020-10-26 06:00:41,839 INFO L714 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2020-10-26 06:00:41,839 INFO L594 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2020-10-26 06:00:41,839 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-26 06:00:41,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2020-10-26 06:00:41,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:00:41,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:00:41,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:00:41,841 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-26 06:00:41,841 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:00:41,842 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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~mem4;havoc max_#t~ite6;havoc max_#t~mem5; 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-26 06:00:41,842 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-26 06:00:41,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:41,843 INFO L82 PathProgramCache]: Analyzing trace with hash -260352212, now seen corresponding path program 1 times [2020-10-26 06:00:41,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:41,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166541799] [2020-10-26 06:00:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:41,875 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:41,917 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:41,929 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:41,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:41,930 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2020-10-26 06:00:41,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:41,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076987634] [2020-10-26 06:00:41,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:41,933 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:41,935 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:41,937 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:41,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:41,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1090370322, now seen corresponding path program 1 times [2020-10-26 06:00:41,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:00:41,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622664475] [2020-10-26 06:00:41,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:00:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:41,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:00:42,015 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:00:42,026 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:00:47,597 WARN L193 SmtUtils]: Spent 5.51 s on a formula simplification. DAG size of input: 433 DAG size of output: 314 [2020-10-26 06:00:48,727 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 182 DAG size of output: 140 [2020-10-26 06:00:48,738 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:00:48,739 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:00:48,739 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:00:48,739 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:00:48,739 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:00:48,739 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:48,739 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:00:48,739 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:00:48,739 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration14_Lasso [2020-10-26 06:00:48,739 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:00:48,739 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:00:48,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:48,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:48,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:48,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:48,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:48,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:48,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:48,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:48,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:49,492 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2020-10-26 06:00:49,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-26 06:00:49,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:49,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-26 06:00:49,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-26 06:00:49,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:49,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:49,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:49,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:49,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:49,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:49,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:49,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:49,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:49,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:00:50,308 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:00:50,308 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-26 06:00:50,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:50,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:50,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:50,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:50,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:50,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:50,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:50,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:50,323 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-26 06:00:50,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:50,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:50,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:50,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:50,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:50,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:50,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:50,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:50,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 06:00:50,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:50,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:50,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:50,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:50,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:50,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:50,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:50,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:50,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:50,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:50,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:50,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:50,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:50,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:50,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:50,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:50,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:50,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:00:50,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:50,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:50,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:50,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:50,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:50,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:50,442 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-26 06:00:50,447 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) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:50,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:50,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:50,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:50,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:50,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:50,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:50,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:50,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:50,475 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) [2020-10-26 06:00:50,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:50,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:50,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:50,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:50,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:50,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:50,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:50,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:50,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:50,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:50,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:00:50,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:50,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:50,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:50,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:00:50,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:00:50,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:50,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:50,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:50,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:50,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:50,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:50,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:50,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:50,569 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) [2020-10-26 06:00:50,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:50,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:50,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:50,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:50,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:50,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:50,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:50,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:50,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:00:50,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:00:50,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:00:50,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:00:50,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:00:50,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:00:50,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:00:50,692 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:00:50,729 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-26 06:00:50,729 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) [2020-10-26 06:00:50,733 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:00:50,736 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:00:50,737 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:00:50,737 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3) = -16*ULTIMATE.start_main_~i~2 + 7*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 Supporting invariants [] [2020-10-26 06:00:50,949 INFO L297 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2020-10-26 06:00:50,951 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 06:00:50,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:00:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:51,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 06:00:51,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:00:51,092 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 06:00:51,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:00:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:00:51,113 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 06:00:51,113 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-26 06:00:51,126 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-26 06:00:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-26 06:00:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 06:00:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2020-10-26 06:00:51,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 2 letters. [2020-10-26 06:00:51,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:51,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 62 letters. Loop has 2 letters. [2020-10-26 06:00:51,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:51,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 4 letters. [2020-10-26 06:00:51,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:00:51,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2020-10-26 06:00:51,132 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 06:00:51,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2020-10-26 06:00:51,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 06:00:51,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 06:00:51,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 06:00:51,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:00:51,133 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 06:00:51,133 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 06:00:51,133 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 06:00:51,133 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-26 06:00:51,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 06:00:51,134 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 06:00:51,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 06:00:51,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 06:00:51 BoogieIcfgContainer [2020-10-26 06:00:51,141 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 06:00:51,142 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 06:00:51,142 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 06:00:51,143 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 06:00:51,143 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:00:30" (3/4) ... [2020-10-26 06:00:51,147 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 06:00:51,147 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 06:00:51,149 INFO L168 Benchmark]: Toolchain (without parser) took 22232.07 ms. Allocated memory was 50.3 MB in the beginning and 226.5 MB in the end (delta: 176.2 MB). Free memory was 27.3 MB in the beginning and 165.1 MB in the end (delta: -137.8 MB). Peak memory consumption was 39.7 MB. Max. memory is 16.1 GB. [2020-10-26 06:00:51,149 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 41.9 MB. Free memory was 21.3 MB in the beginning and 21.2 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:00:51,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.31 ms. Allocated memory is still 50.3 MB. Free memory was 26.7 MB in the beginning and 28.2 MB in the end (delta: -1.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-10-26 06:00:51,150 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.31 ms. Allocated memory is still 50.3 MB. Free memory was 28.2 MB in the beginning and 26.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 06:00:51,151 INFO L168 Benchmark]: Boogie Preprocessor took 76.55 ms. Allocated memory is still 50.3 MB. Free memory was 26.3 MB in the beginning and 24.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 06:00:51,151 INFO L168 Benchmark]: RCFGBuilder took 879.18 ms. Allocated memory is still 50.3 MB. Free memory was 24.9 MB in the beginning and 31.0 MB in the end (delta: -6.1 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. [2020-10-26 06:00:51,152 INFO L168 Benchmark]: BuchiAutomizer took 20819.92 ms. Allocated memory was 50.3 MB in the beginning and 226.5 MB in the end (delta: 176.2 MB). Free memory was 31.0 MB in the beginning and 166.2 MB in the end (delta: -135.2 MB). Peak memory consumption was 40.3 MB. Max. memory is 16.1 GB. [2020-10-26 06:00:51,152 INFO L168 Benchmark]: Witness Printer took 5.30 ms. Allocated memory is still 226.5 MB. Free memory was 166.2 MB in the beginning and 165.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:00:51,155 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.22 ms. Allocated memory is still 41.9 MB. Free memory was 21.3 MB in the beginning and 21.2 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 350.31 ms. Allocated memory is still 50.3 MB. Free memory was 26.7 MB in the beginning and 28.2 MB in the end (delta: -1.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 84.31 ms. Allocated memory is still 50.3 MB. Free memory was 28.2 MB in the beginning and 26.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 76.55 ms. Allocated memory is still 50.3 MB. Free memory was 26.3 MB in the beginning and 24.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 879.18 ms. Allocated memory is still 50.3 MB. Free memory was 24.9 MB in the beginning and 31.0 MB in the end (delta: -6.1 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 20819.92 ms. Allocated memory was 50.3 MB in the beginning and 226.5 MB in the end (delta: 176.2 MB). Free memory was 31.0 MB in the beginning and 166.2 MB in the end (delta: -135.2 MB). Peak memory consumption was 40.3 MB. Max. memory is 16.1 GB. * Witness Printer took 5.30 ms. Allocated memory is still 226.5 MB. Free memory was 166.2 MB in the beginning and 165.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 -16 * i + 7 * unknown-#length-unknown[x] 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 20.7s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 19.0s. Construction of modules took 0.6s. Büchi inclusion checks took 0.7s. 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.6s 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: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...