./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 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/termination-memory-alloca/array01-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash edc22a27a339ef391e3ea3841daa4645b584cc0ad7185141d6d001b72dd17f19 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 09:27:10,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 09:27:10,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 09:27:10,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 09:27:10,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 09:27:10,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 09:27:10,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 09:27:10,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 09:27:10,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 09:27:10,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 09:27:10,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 09:27:10,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 09:27:10,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 09:27:10,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 09:27:10,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 09:27:10,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 09:27:10,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 09:27:10,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 09:27:10,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 09:27:10,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 09:27:10,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 09:27:10,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 09:27:10,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 09:27:10,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 09:27:10,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 09:27:10,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 09:27:10,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 09:27:10,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 09:27:10,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 09:27:10,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 09:27:10,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 09:27:10,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 09:27:10,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 09:27:10,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 09:27:10,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 09:27:10,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 09:27:10,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 09:27:10,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 09:27:10,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 09:27:10,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 09:27:10,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 09:27:10,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-16 09:27:10,354 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 09:27:10,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 09:27:10,355 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 09:27:10,355 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 09:27:10,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 09:27:10,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 09:27:10,356 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 09:27:10,357 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 09:27:10,357 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 09:27:10,357 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 09:27:10,358 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 09:27:10,358 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 09:27:10,358 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 09:27:10,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 09:27:10,359 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 09:27:10,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 09:27:10,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 09:27:10,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 09:27:10,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 09:27:10,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 09:27:10,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 09:27:10,360 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 09:27:10,361 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 09:27:10,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 09:27:10,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 09:27:10,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 09:27:10,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 09:27:10,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 09:27:10,362 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 09:27:10,364 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 09:27:10,364 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> edc22a27a339ef391e3ea3841daa4645b584cc0ad7185141d6d001b72dd17f19 [2021-12-16 09:27:10,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 09:27:10,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 09:27:10,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 09:27:10,646 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 09:27:10,646 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 09:27:10,647 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i [2021-12-16 09:27:10,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f208acd54/9f2d5d66a5024095801b0837be8f0e99/FLAG315c107a8 [2021-12-16 09:27:11,166 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 09:27:11,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i [2021-12-16 09:27:11,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f208acd54/9f2d5d66a5024095801b0837be8f0e99/FLAG315c107a8 [2021-12-16 09:27:11,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f208acd54/9f2d5d66a5024095801b0837be8f0e99 [2021-12-16 09:27:11,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 09:27:11,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 09:27:11,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 09:27:11,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 09:27:11,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 09:27:11,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:27:11" (1/1) ... [2021-12-16 09:27:11,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f5d38d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:11, skipping insertion in model container [2021-12-16 09:27:11,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:27:11" (1/1) ... [2021-12-16 09:27:11,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 09:27:11,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 09:27:11,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:27:11,577 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 09:27:11,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:27:11,623 INFO L208 MainTranslator]: Completed translation [2021-12-16 09:27:11,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:11 WrapperNode [2021-12-16 09:27:11,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 09:27:11,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 09:27:11,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 09:27:11,625 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 09:27:11,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:11" (1/1) ... [2021-12-16 09:27:11,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:11" (1/1) ... [2021-12-16 09:27:11,665 INFO L137 Inliner]: procedures = 111, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2021-12-16 09:27:11,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 09:27:11,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 09:27:11,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 09:27:11,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 09:27:11,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:11" (1/1) ... [2021-12-16 09:27:11,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:11" (1/1) ... [2021-12-16 09:27:11,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:11" (1/1) ... [2021-12-16 09:27:11,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:11" (1/1) ... [2021-12-16 09:27:11,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:11" (1/1) ... [2021-12-16 09:27:11,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:11" (1/1) ... [2021-12-16 09:27:11,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:11" (1/1) ... [2021-12-16 09:27:11,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 09:27:11,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 09:27:11,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 09:27:11,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 09:27:11,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:11" (1/1) ... [2021-12-16 09:27:11,726 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:11,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:11,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:11,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-16 09:27:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 09:27:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 09:27:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 09:27:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 09:27:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 09:27:11,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 09:27:11,880 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 09:27:11,882 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 09:27:12,016 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 09:27:12,020 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 09:27:12,021 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-16 09:27:12,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:27:12 BoogieIcfgContainer [2021-12-16 09:27:12,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 09:27:12,023 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 09:27:12,023 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 09:27:12,026 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 09:27:12,026 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:27:12,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 09:27:11" (1/3) ... [2021-12-16 09:27:12,027 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21800772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:27:12, skipping insertion in model container [2021-12-16 09:27:12,027 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:27:12,028 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:11" (2/3) ... [2021-12-16 09:27:12,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21800772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:27:12, skipping insertion in model container [2021-12-16 09:27:12,028 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:27:12,028 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:27:12" (3/3) ... [2021-12-16 09:27:12,029 INFO L388 chiAutomizerObserver]: Analyzing ICFG array01-alloca-1.i [2021-12-16 09:27:12,061 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 09:27:12,072 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 09:27:12,073 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 09:27:12,073 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 09:27:12,073 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 09:27:12,073 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 09:27:12,073 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 09:27:12,073 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 09:27:12,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:12,119 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-16 09:27:12,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:12,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:12,123 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-16 09:27:12,123 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:12,124 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 09:27:12,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:12,125 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-16 09:27:12,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:12,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:12,125 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-16 09:27:12,126 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:12,132 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 5#L561true assume !(main_~array_size~0#1 < 1); 8#L561-2true call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 12#L565-3true [2021-12-16 09:27:12,133 INFO L793 eck$LassoCheckResult]: Loop: 12#L565-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 14#L565-2true main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12#L565-3true [2021-12-16 09:27:12,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:12,143 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-12-16 09:27:12,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:12,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753167759] [2021-12-16 09:27:12,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:12,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:12,242 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:12,274 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:12,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:12,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-12-16 09:27:12,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:12,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167835614] [2021-12-16 09:27:12,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:12,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:12,301 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:12,319 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:12,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:12,321 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-12-16 09:27:12,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:12,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215818219] [2021-12-16 09:27:12,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:12,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:12,349 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:12,378 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:12,622 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:27:12,622 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:27:12,623 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:27:12,623 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:27:12,623 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:27:12,623 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:12,623 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:27:12,623 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:27:12,623 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration1_Lasso [2021-12-16 09:27:12,623 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:27:12,624 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:27:12,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:12,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:12,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:12,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:12,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:12,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:12,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:12,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:12,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:12,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:13,037 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:27:13,040 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:27:13,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:13,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:13,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:13,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:13,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-16 09:27:13,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:13,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:13,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:13,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:13,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:13,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:13,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:13,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:13,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-16 09:27:13,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:13,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:13,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:13,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-16 09:27:13,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:13,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:13,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:13,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:13,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:13,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:13,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:13,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:13,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-16 09:27:13,142 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:13,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:13,143 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:13,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-16 09:27:13,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:13,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:13,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:13,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:13,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:13,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:13,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:13,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:13,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:13,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:13,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:13,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:13,184 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:13,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-16 09:27:13,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:13,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:13,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:13,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:13,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:13,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:13,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:13,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:13,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:13,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:13,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:13,241 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:13,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-16 09:27:13,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:13,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:13,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:13,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:13,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:13,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:13,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:13,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:13,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:13,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:13,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:13,276 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:13,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-16 09:27:13,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:13,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:13,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:13,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:13,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:13,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:13,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:13,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:13,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:13,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-12-16 09:27:13,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:13,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:13,304 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:13,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-16 09:27:13,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:13,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:13,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:13,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:13,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:13,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:13,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:13,345 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:27:13,379 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-12-16 09:27:13,379 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-16 09:27:13,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:13,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:13,399 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:13,423 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:27:13,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-16 09:27:13,441 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-16 09:27:13,442 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:27:13,442 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_1) = -4*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0#1.offset >= 0] [2021-12-16 09:27:13,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:13,485 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2021-12-16 09:27:13,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:13,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:27:13,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:13,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 09:27:13,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:13,602 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 [2021-12-16 09:27:13,603 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:13,688 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 53 transitions. Complement of second has 7 states. [2021-12-16 09:27:13,689 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 [2021-12-16 09:27:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2021-12-16 09:27:13,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-16 09:27:13,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:13,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-16 09:27:13,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:13,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 4 letters. [2021-12-16 09:27:13,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:13,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2021-12-16 09:27:13,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-16 09:27:13,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:13,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 16 transitions. [2021-12-16 09:27:13,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-16 09:27:13,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-16 09:27:13,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2021-12-16 09:27:13,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:27:13,714 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-16 09:27:13,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2021-12-16 09:27:13,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-16 09:27:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2021-12-16 09:27:13,734 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-16 09:27:13,734 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-16 09:27:13,734 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 09:27:13,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2021-12-16 09:27:13,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-16 09:27:13,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:13,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:13,737 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:27:13,737 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:27:13,737 INFO L791 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 124#L561 assume !(main_~array_size~0#1 < 1); 125#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 126#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 128#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 131#L551-3 [2021-12-16 09:27:13,737 INFO L793 eck$LassoCheckResult]: Loop: 131#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 120#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 121#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 130#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 131#L551-3 [2021-12-16 09:27:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:13,740 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-12-16 09:27:13,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:13,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413028609] [2021-12-16 09:27:13,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:13,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:13,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:27:13,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413028609] [2021-12-16 09:27:13,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413028609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:27:13,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:27:13,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:27:13,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137514775] [2021-12-16 09:27:13,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:27:13,829 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:27:13,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:13,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 1 times [2021-12-16 09:27:13,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:13,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054586329] [2021-12-16 09:27:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:13,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:13,844 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:13,849 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:13,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:27:13,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:27:13,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:27:13,900 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:27:13,918 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2021-12-16 09:27:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:27:13,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2021-12-16 09:27:13,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-16 09:27:13,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2021-12-16 09:27:13,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-16 09:27:13,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-16 09:27:13,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2021-12-16 09:27:13,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:27:13,921 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2021-12-16 09:27:13,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2021-12-16 09:27:13,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2021-12-16 09:27:13,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2021-12-16 09:27:13,922 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2021-12-16 09:27:13,922 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2021-12-16 09:27:13,922 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 09:27:13,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2021-12-16 09:27:13,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-16 09:27:13,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:13,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:13,924 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:13,924 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:27:13,924 INFO L791 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 154#L561 assume !(main_~array_size~0#1 < 1); 155#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 156#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 157#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 158#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 159#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 163#L551-3 [2021-12-16 09:27:13,924 INFO L793 eck$LassoCheckResult]: Loop: 163#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 160#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 161#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 162#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 163#L551-3 [2021-12-16 09:27:13,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:13,925 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-12-16 09:27:13,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:13,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783134416] [2021-12-16 09:27:13,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:13,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:13,935 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:13,947 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:13,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:13,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 2 times [2021-12-16 09:27:13,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:13,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531392090] [2021-12-16 09:27:13,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:13,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:13,954 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:13,957 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:13,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:13,958 INFO L85 PathProgramCache]: Analyzing trace with hash -357810950, now seen corresponding path program 1 times [2021-12-16 09:27:13,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:13,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353196962] [2021-12-16 09:27:13,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:13,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:13,969 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:13,980 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:14,331 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:27:14,331 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:27:14,331 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:27:14,331 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:27:14,331 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:27:14,331 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:14,331 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:27:14,331 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:27:14,332 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration3_Lasso [2021-12-16 09:27:14,332 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:27:14,332 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:27:14,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:14,821 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:27:14,822 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:27:14,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:14,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:14,826 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:14,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-16 09:27:14,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:14,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:14,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:14,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:14,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:14,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:14,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:14,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:14,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:14,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:14,868 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:14,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:14,869 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:14,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-16 09:27:14,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:14,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:14,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:14,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:14,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:14,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:14,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:14,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:14,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:14,936 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:14,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:14,937 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:14,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-16 09:27:14,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:14,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:14,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:14,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:14,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:14,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:14,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:14,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:14,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:14,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:14,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:14,993 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:14,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-16 09:27:14,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:15,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:15,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:15,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:15,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:15,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:15,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:15,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:15,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:15,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:15,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:15,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:15,057 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:15,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:15,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:15,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:15,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:15,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:15,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:15,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:15,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-16 09:27:15,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:15,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-12-16 09:27:15,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:15,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:15,108 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:15,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-16 09:27:15,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:15,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:15,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:15,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:15,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:15,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:15,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:15,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:15,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:15,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:15,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:15,148 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:15,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-16 09:27:15,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:15,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:15,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:15,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:15,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:15,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:15,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:15,172 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:15,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:15,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:15,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:15,189 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:15,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-16 09:27:15,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:15,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:15,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:15,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:15,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:15,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:15,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:15,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:15,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:15,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:15,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:15,256 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:15,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-16 09:27:15,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:15,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:15,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:15,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:15,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:15,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:15,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:15,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:15,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:15,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:15,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:15,291 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:15,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-16 09:27:15,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:15,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:15,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:15,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:15,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:15,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:15,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:15,337 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:27:15,366 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-16 09:27:15,367 INFO L444 ModelExtractionUtils]: 12 out of 37 variables were initially zero. Simplification set additionally 21 variables to zero. [2021-12-16 09:27:15,367 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:15,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:15,372 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:15,420 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:27:15,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-16 09:27:15,436 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-16 09:27:15,436 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:27:15,436 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_2, ULTIMATE.start_test_fun_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_2 - 4*ULTIMATE.start_test_fun_~i~0#1 Supporting invariants [1*ULTIMATE.start_test_fun_~a#1.offset >= 0] [2021-12-16 09:27:15,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:15,471 INFO L297 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2021-12-16 09:27:15,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:15,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 09:27:15,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:15,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 09:27:15,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:15,600 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-16 09:27:15,600 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:15,632 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 23 transitions. Complement of second has 7 states. [2021-12-16 09:27:15,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2021-12-16 09:27:15,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2021-12-16 09:27:15,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:15,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 12 letters. Loop has 4 letters. [2021-12-16 09:27:15,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:15,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 8 letters. [2021-12-16 09:27:15,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:15,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2021-12-16 09:27:15,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:15,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 22 transitions. [2021-12-16 09:27:15,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-16 09:27:15,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-16 09:27:15,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2021-12-16 09:27:15,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:15,637 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2021-12-16 09:27:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2021-12-16 09:27:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2021-12-16 09:27:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2021-12-16 09:27:15,639 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-16 09:27:15,639 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-16 09:27:15,639 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 09:27:15,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2021-12-16 09:27:15,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:15,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:15,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:15,640 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:15,640 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:15,640 INFO L791 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 279#L561 assume !(main_~array_size~0#1 < 1); 280#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 281#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 282#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 283#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 284#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 287#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 273#L552-3 [2021-12-16 09:27:15,641 INFO L793 eck$LassoCheckResult]: Loop: 273#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 274#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 273#L552-3 [2021-12-16 09:27:15,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:15,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2021-12-16 09:27:15,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:15,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41881645] [2021-12-16 09:27:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:15,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:15,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:15,660 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:15,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2021-12-16 09:27:15,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:15,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141972548] [2021-12-16 09:27:15,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:15,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:15,665 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:15,669 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:15,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:15,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2021-12-16 09:27:15,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:15,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665414083] [2021-12-16 09:27:15,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:15,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:15,681 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:15,693 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:15,980 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:27:15,980 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:27:15,980 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:27:15,980 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:27:15,980 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:27:15,980 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:15,980 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:27:15,980 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:27:15,980 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration4_Lasso [2021-12-16 09:27:15,980 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:27:15,980 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:27:15,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:15,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:15,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:15,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:15,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:15,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:15,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:15,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:16,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:16,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:16,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:16,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:16,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:16,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:16,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:16,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:16,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:16,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:16,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:16,524 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:27:16,524 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:27:16,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:16,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:16,528 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:16,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:16,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:16,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:16,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:16,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:16,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:16,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:16,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-16 09:27:16,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:16,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:16,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:16,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:16,593 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:16,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-16 09:27:16,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:16,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:16,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:16,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:16,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:16,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:16,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:16,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:16,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:16,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:16,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:16,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:16,624 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:16,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-16 09:27:16,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:16,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:16,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:16,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:16,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:16,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:16,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:16,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:16,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:16,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-16 09:27:16,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:16,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:16,649 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:16,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-16 09:27:16,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:16,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:16,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:16,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:16,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:16,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:16,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:16,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:16,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-16 09:27:16,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:16,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:16,684 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:16,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-16 09:27:16,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:16,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:16,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:16,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:16,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:16,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:16,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:16,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:16,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:16,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-16 09:27:16,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:16,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:16,710 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:16,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-16 09:27:16,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:16,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:16,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:16,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:16,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:16,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:16,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:16,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:16,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:16,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-16 09:27:16,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:16,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:16,743 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:16,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-16 09:27:16,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:16,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:16,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:16,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:16,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:16,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:16,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:16,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:16,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:16,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-16 09:27:16,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:16,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:16,769 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:16,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-16 09:27:16,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:16,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:16,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:16,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:16,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:16,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:16,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:16,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:16,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:16,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-16 09:27:16,795 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:16,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:16,796 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:16,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-16 09:27:16,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:16,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:16,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:16,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:16,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:16,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:16,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:16,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:16,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-12-16 09:27:16,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:16,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:16,855 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:16,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-16 09:27:16,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:16,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:16,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:16,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:16,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:16,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:16,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:16,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:16,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-16 09:27:16,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:16,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:16,899 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:16,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-16 09:27:16,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:16,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:16,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:16,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:16,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:16,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:16,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:16,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:16,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-16 09:27:16,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:16,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:16,929 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:16,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-16 09:27:16,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:16,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:16,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:16,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:16,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:16,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:16,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:16,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:16,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-16 09:27:16,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:16,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:16,957 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:16,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-16 09:27:16,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:16,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:16,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:16,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:16,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:16,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:16,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:16,972 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:27:16,978 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-16 09:27:16,978 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-16 09:27:16,978 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:16,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:16,979 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:16,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-16 09:27:16,982 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:27:16,989 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 09:27:16,989 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:27:16,989 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) ULTIMATE.start_main_~numbers~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) ULTIMATE.start_main_~numbers~0#1.offset)_1 Supporting invariants [] [2021-12-16 09:27:17,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-16 09:27:17,022 INFO L297 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2021-12-16 09:27:17,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:17,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 09:27:17,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:17,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:17,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:17,138 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-16 09:27:17,138 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:17,174 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 31 transitions. Complement of second has 8 states. [2021-12-16 09:27:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2021-12-16 09:27:17,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2021-12-16 09:27:17,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:17,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2021-12-16 09:27:17,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:17,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2021-12-16 09:27:17,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:17,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2021-12-16 09:27:17,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:17,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 24 transitions. [2021-12-16 09:27:17,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-16 09:27:17,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-16 09:27:17,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2021-12-16 09:27:17,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:17,178 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-12-16 09:27:17,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2021-12-16 09:27:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-12-16 09:27:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2021-12-16 09:27:17,179 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2021-12-16 09:27:17,179 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2021-12-16 09:27:17,179 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 09:27:17,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2021-12-16 09:27:17,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:17,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:17,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:17,180 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:17,180 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:17,180 INFO L791 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 402#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 407#L561 assume !(main_~array_size~0#1 < 1); 408#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 409#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 410#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 411#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 412#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 415#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 416#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 417#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 413#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 414#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 403#L552-3 [2021-12-16 09:27:17,180 INFO L793 eck$LassoCheckResult]: Loop: 403#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 404#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 403#L552-3 [2021-12-16 09:27:17,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:17,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1792762469, now seen corresponding path program 2 times [2021-12-16 09:27:17,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:17,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692614671] [2021-12-16 09:27:17,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:17,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:17,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:27:17,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692614671] [2021-12-16 09:27:17,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692614671] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:27:17,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001541288] [2021-12-16 09:27:17,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 09:27:17,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:27:17,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:17,242 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:27:17,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-12-16 09:27:17,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 09:27:17,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:27:17,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 09:27:17,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:17,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:27:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:17,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001541288] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:27:17,385 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:27:17,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2021-12-16 09:27:17,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769469320] [2021-12-16 09:27:17,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:27:17,385 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:27:17,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:17,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2021-12-16 09:27:17,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:17,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615331435] [2021-12-16 09:27:17,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:17,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:17,390 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:17,393 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:17,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:27:17,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 09:27:17,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-16 09:27:17,453 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:17,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:17,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:27:17,549 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2021-12-16 09:27:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 09:27:17,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2021-12-16 09:27:17,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:17,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2021-12-16 09:27:17,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-16 09:27:17,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-16 09:27:17,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2021-12-16 09:27:17,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:17,554 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-16 09:27:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2021-12-16 09:27:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-12-16 09:27:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-12-16 09:27:17,555 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-12-16 09:27:17,555 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-12-16 09:27:17,555 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-16 09:27:17,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2021-12-16 09:27:17,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:17,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:17,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:17,556 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:17,556 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:17,557 INFO L791 eck$LassoCheckResult]: Stem: 556#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 557#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 558#L561 assume !(main_~array_size~0#1 < 1); 559#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 552#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 553#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 554#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 555#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 567#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 565#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 562#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 563#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 566#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 560#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 561#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 548#L552-3 [2021-12-16 09:27:17,557 INFO L793 eck$LassoCheckResult]: Loop: 548#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 549#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 548#L552-3 [2021-12-16 09:27:17,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:17,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1166615491, now seen corresponding path program 3 times [2021-12-16 09:27:17,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:17,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223602007] [2021-12-16 09:27:17,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:17,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:17,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:17,583 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:17,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:17,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2021-12-16 09:27:17,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:17,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551688310] [2021-12-16 09:27:17,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:17,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:17,588 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:17,591 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:17,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash 131023752, now seen corresponding path program 1 times [2021-12-16 09:27:17,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:17,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121558829] [2021-12-16 09:27:17,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:17,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:17,609 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:17,629 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:18,007 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:27:18,008 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:27:18,008 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:27:18,008 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:27:18,008 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:27:18,008 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:18,008 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:27:18,008 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:27:18,008 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration6_Lasso [2021-12-16 09:27:18,008 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:27:18,008 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:27:18,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:18,537 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:27:18,538 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:27:18,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:18,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:18,544 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:18,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-16 09:27:18,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:18,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:18,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:18,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:18,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:18,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:18,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:18,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:18,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:18,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:18,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:18,584 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:18,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-16 09:27:18,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:18,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:18,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:18,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:18,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:18,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:18,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:18,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:18,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-12-16 09:27:18,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:18,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:18,617 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:18,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:18,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-16 09:27:18,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:18,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:18,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:18,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:18,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:18,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:18,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:18,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:18,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:18,677 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:18,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:18,677 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:18,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-16 09:27:18,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:18,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:18,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:18,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:18,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:18,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:18,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:18,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:18,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:18,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:18,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:18,707 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:18,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-16 09:27:18,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:18,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:18,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:18,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:18,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:18,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:18,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:18,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:18,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:18,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-12-16 09:27:18,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:18,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:18,734 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:18,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-16 09:27:18,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:18,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:18,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:18,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:18,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:18,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:18,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:18,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:18,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:18,803 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:18,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:18,804 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:18,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:18,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:18,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:18,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:18,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:18,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:18,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:18,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:18,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-16 09:27:18,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:18,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:18,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:18,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:18,863 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:18,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:18,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:18,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:18,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:18,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:18,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:18,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:18,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-16 09:27:18,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:18,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-16 09:27:18,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:18,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:18,900 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:18,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-16 09:27:18,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:18,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:18,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:18,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:18,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:18,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:18,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:18,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:18,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:18,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-16 09:27:18,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:18,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:18,929 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:18,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-16 09:27:18,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:18,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:18,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:18,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:18,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:18,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:18,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:18,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:18,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:18,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:18,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:18,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:18,955 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:18,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-16 09:27:18,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:18,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:18,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:18,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:18,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:18,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:18,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:18,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:18,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:18,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-12-16 09:27:18,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:18,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:18,981 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:18,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-16 09:27:18,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:18,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:18,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:18,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:18,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:18,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:18,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:18,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:18,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:19,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-12-16 09:27:19,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:19,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:19,008 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:19,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-16 09:27:19,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:19,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:19,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:19,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:19,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:19,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:19,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:19,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:19,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-16 09:27:19,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:19,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:19,037 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:19,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-16 09:27:19,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:19,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:19,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:19,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:19,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:19,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:19,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:19,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:19,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:19,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:19,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:19,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:19,068 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:19,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:19,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-16 09:27:19,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:19,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:19,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:19,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:19,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:19,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:19,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:19,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:19,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2021-12-16 09:27:19,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:19,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:19,094 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:19,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-16 09:27:19,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:19,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:19,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:19,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:19,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:19,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:19,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:19,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:19,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:19,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:19,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:19,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:19,121 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:19,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-16 09:27:19,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:19,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:19,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:19,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:19,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:19,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:19,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:19,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:19,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:19,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:19,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:19,161 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:19,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-16 09:27:19,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:19,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:19,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:19,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:19,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:19,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:19,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:19,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:19,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-12-16 09:27:19,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:19,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:19,193 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:19,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-16 09:27:19,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:19,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:19,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:19,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:19,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:19,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:19,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:19,210 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:27:19,217 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-16 09:27:19,217 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-16 09:27:19,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:19,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:19,218 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:19,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-16 09:27:19,220 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:27:19,226 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 09:27:19,226 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:27:19,227 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 4))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 4))_1 Supporting invariants [] [2021-12-16 09:27:19,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:19,258 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2021-12-16 09:27:19,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:19,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-16 09:27:19,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:19,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:19,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:19,452 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-16 09:27:19,453 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:19,477 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 26 transitions. Complement of second has 4 states. [2021-12-16 09:27:19,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-16 09:27:19,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 2 letters. [2021-12-16 09:27:19,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:19,479 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:19,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:19,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-16 09:27:19,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:19,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:19,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:19,629 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-16 09:27:19,629 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:19,651 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 26 transitions. Complement of second has 4 states. [2021-12-16 09:27:19,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-16 09:27:19,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 2 letters. [2021-12-16 09:27:19,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:19,652 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:19,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:19,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:19,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-16 09:27:19,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:19,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:19,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:19,828 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-16 09:27:19,828 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:19,884 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 43 transitions. Complement of second has 10 states. [2021-12-16 09:27:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-16 09:27:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2021-12-16 09:27:19,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 2 letters. [2021-12-16 09:27:19,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:19,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 17 letters. Loop has 2 letters. [2021-12-16 09:27:19,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:19,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 4 letters. [2021-12-16 09:27:19,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:19,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2021-12-16 09:27:19,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:19,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 36 transitions. [2021-12-16 09:27:19,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-16 09:27:19,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-16 09:27:19,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2021-12-16 09:27:19,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:19,888 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-12-16 09:27:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2021-12-16 09:27:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2021-12-16 09:27:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2021-12-16 09:27:19,889 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-12-16 09:27:19,889 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-12-16 09:27:19,889 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-16 09:27:19,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2021-12-16 09:27:19,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:19,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:19,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:19,890 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:19,890 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:19,891 INFO L791 eck$LassoCheckResult]: Stem: 904#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 905#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 906#L561 assume !(main_~array_size~0#1 < 1); 907#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 908#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 909#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 910#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 911#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 914#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 920#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 915#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 916#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 922#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 921#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 917#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 918#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 924#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 912#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 913#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 900#L552-3 [2021-12-16 09:27:19,891 INFO L793 eck$LassoCheckResult]: Loop: 900#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 901#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 900#L552-3 [2021-12-16 09:27:19,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:19,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1359773592, now seen corresponding path program 4 times [2021-12-16 09:27:19,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:19,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864942776] [2021-12-16 09:27:19,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:19,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:19,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:27:19,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864942776] [2021-12-16 09:27:19,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864942776] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:27:19,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273864927] [2021-12-16 09:27:19,950 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 09:27:19,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:27:19,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:19,951 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:27:19,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2021-12-16 09:27:19,992 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 09:27:19,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:27:19,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 09:27:19,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:20,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:27:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:20,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273864927] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:27:20,124 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:27:20,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2021-12-16 09:27:20,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996652415] [2021-12-16 09:27:20,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:27:20,125 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:27:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:20,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 4 times [2021-12-16 09:27:20,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:20,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962715773] [2021-12-16 09:27:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:20,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:20,129 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:20,132 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:20,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:27:20,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 09:27:20,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-12-16 09:27:20,162 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. cyclomatic complexity: 10 Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:20,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:27:20,248 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2021-12-16 09:27:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 09:27:20,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2021-12-16 09:27:20,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:20,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 28 states and 33 transitions. [2021-12-16 09:27:20,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-16 09:27:20,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-16 09:27:20,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2021-12-16 09:27:20,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:20,249 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-16 09:27:20,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2021-12-16 09:27:20,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-16 09:27:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2021-12-16 09:27:20,251 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-12-16 09:27:20,251 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-12-16 09:27:20,251 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-16 09:27:20,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2021-12-16 09:27:20,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:20,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:20,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:20,252 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:20,252 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:20,252 INFO L791 eck$LassoCheckResult]: Stem: 1102#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1103#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1104#L561 assume !(main_~array_size~0#1 < 1); 1105#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 1106#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1107#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1108#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1109#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1124#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1123#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1122#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1116#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 1112#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1113#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1120#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1110#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1111#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1114#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1119#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1118#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1117#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1098#L552-3 [2021-12-16 09:27:20,252 INFO L793 eck$LassoCheckResult]: Loop: 1098#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1099#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1098#L552-3 [2021-12-16 09:27:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:20,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1255193994, now seen corresponding path program 5 times [2021-12-16 09:27:20,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:20,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061287729] [2021-12-16 09:27:20,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:20,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:20,279 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:20,291 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 5 times [2021-12-16 09:27:20,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:20,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564736155] [2021-12-16 09:27:20,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:20,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:20,298 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:20,301 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:20,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:20,301 INFO L85 PathProgramCache]: Analyzing trace with hash 644383099, now seen corresponding path program 2 times [2021-12-16 09:27:20,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:20,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920608774] [2021-12-16 09:27:20,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:20,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:20,314 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:20,327 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:20,806 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:27:20,806 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:27:20,806 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:27:20,806 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:27:20,806 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:27:20,807 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:20,807 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:27:20,807 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:27:20,807 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration8_Lasso [2021-12-16 09:27:20,807 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:27:20,807 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:27:20,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:20,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:20,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:20,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:20,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:21,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:21,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:21,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:21,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:21,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:21,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:21,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:21,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:21,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:21,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:21,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:21,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:21,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:21,401 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:27:21,401 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:27:21,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:21,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:21,403 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:21,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-16 09:27:21,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:21,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:21,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:21,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:21,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:21,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:21,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:21,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:21,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:21,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2021-12-16 09:27:21,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:21,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:21,429 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:21,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-16 09:27:21,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:21,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:21,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:21,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:21,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:21,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:21,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:21,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:21,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:21,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-12-16 09:27:21,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:21,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:21,459 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:21,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-16 09:27:21,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:21,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:21,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:21,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:21,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:21,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:21,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:21,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:21,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2021-12-16 09:27:21,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:21,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:21,486 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:21,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-16 09:27:21,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:21,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:21,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:21,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:21,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:21,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:21,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:21,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:21,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:21,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-12-16 09:27:21,509 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:21,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:21,510 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:21,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-16 09:27:21,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:21,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:21,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:21,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:21,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:21,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:21,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:21,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:21,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:21,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:21,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:21,542 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:21,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-16 09:27:21,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:21,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:21,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:21,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:21,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:21,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:21,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:21,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:21,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2021-12-16 09:27:21,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:21,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:21,571 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:21,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-16 09:27:21,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:21,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:21,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:21,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:21,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:21,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:21,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:21,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:21,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-12-16 09:27:21,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:21,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:21,610 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:21,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-12-16 09:27:21,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:21,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:21,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:21,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:21,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:21,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:21,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:21,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:21,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:21,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:21,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:21,639 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:21,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-12-16 09:27:21,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:21,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:21,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:21,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:21,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:21,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:21,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:21,653 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:27:21,659 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-16 09:27:21,659 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-16 09:27:21,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:21,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:21,660 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:21,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-12-16 09:27:21,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:27:21,668 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 09:27:21,668 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:27:21,668 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 8))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 8))_1 Supporting invariants [] [2021-12-16 09:27:21,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2021-12-16 09:27:21,724 INFO L297 tatePredicateManager]: 18 out of 20 supporting invariants were superfluous and have been removed [2021-12-16 09:27:21,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:21,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-16 09:27:21,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:21,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:21,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:21,915 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2021-12-16 09:27:21,915 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:21,935 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 34 transitions. Complement of second has 4 states. [2021-12-16 09:27:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-16 09:27:21,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 21 letters. Loop has 2 letters. [2021-12-16 09:27:21,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:21,936 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:21,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:21,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-16 09:27:21,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:22,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:22,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:22,144 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2021-12-16 09:27:22,144 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:22,167 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 34 transitions. Complement of second has 4 states. [2021-12-16 09:27:22,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-16 09:27:22,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 21 letters. Loop has 2 letters. [2021-12-16 09:27:22,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:22,169 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:22,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:22,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-16 09:27:22,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:22,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:22,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:22,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:22,389 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2021-12-16 09:27:22,389 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:22,464 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 53 transitions. Complement of second has 12 states. [2021-12-16 09:27:22,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-16 09:27:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2021-12-16 09:27:22,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 21 letters. Loop has 2 letters. [2021-12-16 09:27:22,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:22,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 23 letters. Loop has 2 letters. [2021-12-16 09:27:22,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:22,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 21 letters. Loop has 4 letters. [2021-12-16 09:27:22,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:22,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2021-12-16 09:27:22,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:22,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 38 states and 46 transitions. [2021-12-16 09:27:22,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-16 09:27:22,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-16 09:27:22,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2021-12-16 09:27:22,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:22,467 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-12-16 09:27:22,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2021-12-16 09:27:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2021-12-16 09:27:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:22,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-12-16 09:27:22,470 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-16 09:27:22,470 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-16 09:27:22,470 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-16 09:27:22,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2021-12-16 09:27:22,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:22,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:22,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:22,471 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:22,471 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:22,471 INFO L791 eck$LassoCheckResult]: Stem: 1580#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1581#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1582#L561 assume !(main_~array_size~0#1 < 1); 1583#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 1584#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1585#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1586#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1587#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1595#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1594#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1593#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1592#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 1590#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1577#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1578#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1588#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1589#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1591#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1605#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1604#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1603#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1602#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1599#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1598#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1596#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1575#L552-3 [2021-12-16 09:27:22,471 INFO L793 eck$LassoCheckResult]: Loop: 1575#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1576#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1575#L552-3 [2021-12-16 09:27:22,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:22,471 INFO L85 PathProgramCache]: Analyzing trace with hash 776867019, now seen corresponding path program 6 times [2021-12-16 09:27:22,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:22,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469599917] [2021-12-16 09:27:22,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:22,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:22,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:27:22,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469599917] [2021-12-16 09:27:22,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469599917] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:27:22,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533212011] [2021-12-16 09:27:22,537 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-16 09:27:22,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:27:22,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:22,539 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:27:22,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2021-12-16 09:27:22,586 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-16 09:27:22,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:27:22,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 09:27:22,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:22,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:27:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:22,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533212011] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:27:22,756 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:27:22,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2021-12-16 09:27:22,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999392592] [2021-12-16 09:27:22,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:27:22,756 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:27:22,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:22,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 6 times [2021-12-16 09:27:22,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:22,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544834943] [2021-12-16 09:27:22,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:22,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:22,762 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:22,765 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:22,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:27:22,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-16 09:27:22,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-12-16 09:27:22,802 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. cyclomatic complexity: 12 Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:27:22,894 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2021-12-16 09:27:22,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 09:27:22,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 61 transitions. [2021-12-16 09:27:22,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:22,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 35 states and 41 transitions. [2021-12-16 09:27:22,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-16 09:27:22,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-16 09:27:22,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2021-12-16 09:27:22,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:22,896 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2021-12-16 09:27:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2021-12-16 09:27:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-12-16 09:27:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2021-12-16 09:27:22,901 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-12-16 09:27:22,901 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-12-16 09:27:22,901 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-16 09:27:22,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2021-12-16 09:27:22,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:22,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:22,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:22,902 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:22,902 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:22,902 INFO L791 eck$LassoCheckResult]: Stem: 1838#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1839#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1840#L561 assume !(main_~array_size~0#1 < 1); 1841#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 1842#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1843#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1844#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1845#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1848#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1861#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1860#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1857#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1856#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1851#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 1849#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1850#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1865#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1846#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1847#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1835#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1836#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1858#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1864#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1863#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1855#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1854#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1852#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1833#L552-3 [2021-12-16 09:27:22,902 INFO L793 eck$LassoCheckResult]: Loop: 1833#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1834#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1833#L552-3 [2021-12-16 09:27:22,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:22,903 INFO L85 PathProgramCache]: Analyzing trace with hash -914443991, now seen corresponding path program 7 times [2021-12-16 09:27:22,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:22,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503992245] [2021-12-16 09:27:22,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:22,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:22,917 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:22,932 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:22,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:22,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 7 times [2021-12-16 09:27:22,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:22,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193817280] [2021-12-16 09:27:22,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:22,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:22,936 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:22,939 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:22,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:22,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1687621486, now seen corresponding path program 3 times [2021-12-16 09:27:22,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:22,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322913244] [2021-12-16 09:27:22,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:22,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:22,952 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:22,970 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:23,571 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:27:23,571 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:27:23,571 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:27:23,571 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:27:23,571 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:27:23,571 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:23,571 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:27:23,571 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:27:23,571 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration10_Lasso [2021-12-16 09:27:23,571 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:27:23,571 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:27:23,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:23,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:24,225 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:27:24,225 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:27:24,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,227 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-12-16 09:27:24,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:24,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:24,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:24,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:24,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:24,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:24,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:24,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:24,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:24,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,254 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-12-16 09:27:24,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:24,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:24,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:24,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:24,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:24,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:24,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:24,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:24,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2021-12-16 09:27:24,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,281 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-12-16 09:27:24,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:24,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:24,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:24,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:24,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:24,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:24,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:24,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:24,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:24,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2021-12-16 09:27:24,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,315 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-12-16 09:27:24,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:24,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:24,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:24,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:24,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:24,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:24,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:24,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:24,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-12-16 09:27:24,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,351 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-12-16 09:27:24,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:24,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:24,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:24,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:24,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:24,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:24,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:24,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:24,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:24,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:24,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,376 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-12-16 09:27:24,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:24,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:24,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:24,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:24,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:24,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:24,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:24,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:24,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:24,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2021-12-16 09:27:24,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,405 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-12-16 09:27:24,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:24,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:24,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:24,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:24,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:24,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:24,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:24,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:24,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:24,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-12-16 09:27:24,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,431 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-12-16 09:27:24,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:24,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:24,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:24,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:24,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:24,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:24,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:24,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:24,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:24,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,464 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-12-16 09:27:24,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:24,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:24,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:24,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:24,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:24,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:24,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:24,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:24,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:24,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-12-16 09:27:24,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,489 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-12-16 09:27:24,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:24,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:24,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:24,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:24,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:24,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:24,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:24,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:24,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:24,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-12-16 09:27:24,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,544 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-12-16 09:27:24,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:24,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:24,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:24,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:24,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:24,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:24,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:24,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:24,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:24,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,571 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-12-16 09:27:24,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:24,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:24,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:24,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:24,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:24,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:24,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:24,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:24,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:24,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:24,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,595 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-12-16 09:27:24,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:24,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:24,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:24,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:24,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:24,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:24,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:24,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:24,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:24,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2021-12-16 09:27:24,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,620 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-12-16 09:27:24,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:24,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:24,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:24,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:24,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:24,629 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:24,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:24,634 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:27:24,640 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-16 09:27:24,640 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-16 09:27:24,640 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:24,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:24,641 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:24,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-12-16 09:27:24,642 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:27:24,649 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 09:27:24,649 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:27:24,649 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* ULTIMATE.start_main_~i~1#1 4) ULTIMATE.start_main_~numbers~0#1.offset (- 4)))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* ULTIMATE.start_main_~i~1#1 4) ULTIMATE.start_main_~numbers~0#1.offset (- 4)))_2 Supporting invariants [] [2021-12-16 09:27:24,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:24,718 INFO L297 tatePredicateManager]: 31 out of 33 supporting invariants were superfluous and have been removed [2021-12-16 09:27:24,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:24,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-16 09:27:24,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:24,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:25,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:25,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:25,129 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2021-12-16 09:27:25,129 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12 Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:25,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 48 transitions. Complement of second has 9 states. [2021-12-16 09:27:25,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 7 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2021-12-16 09:27:25,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 27 letters. Loop has 2 letters. [2021-12-16 09:27:25,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:25,193 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:25,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:25,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-16 09:27:25,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:25,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:25,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:25,544 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2021-12-16 09:27:25,544 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12 Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:25,623 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 48 transitions. Complement of second has 9 states. [2021-12-16 09:27:25,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 7 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2021-12-16 09:27:25,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 27 letters. Loop has 2 letters. [2021-12-16 09:27:25,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:25,628 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:25,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:25,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-16 09:27:25,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:25,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:25,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:25,977 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2021-12-16 09:27:25,977 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12 Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:26,164 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 81 states and 102 transitions. Complement of second has 20 states. [2021-12-16 09:27:26,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-16 09:27:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 59 transitions. [2021-12-16 09:27:26,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 59 transitions. Stem has 27 letters. Loop has 2 letters. [2021-12-16 09:27:26,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:26,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 59 transitions. Stem has 29 letters. Loop has 2 letters. [2021-12-16 09:27:26,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:26,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 59 transitions. Stem has 27 letters. Loop has 4 letters. [2021-12-16 09:27:26,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:26,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 102 transitions. [2021-12-16 09:27:26,168 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-16 09:27:26,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 76 states and 95 transitions. [2021-12-16 09:27:26,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-16 09:27:26,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-16 09:27:26,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 95 transitions. [2021-12-16 09:27:26,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:26,169 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 95 transitions. [2021-12-16 09:27:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 95 transitions. [2021-12-16 09:27:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 43. [2021-12-16 09:27:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2021-12-16 09:27:26,172 INFO L704 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2021-12-16 09:27:26,172 INFO L587 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2021-12-16 09:27:26,172 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-16 09:27:26,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2021-12-16 09:27:26,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:26,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:26,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:26,173 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:26,173 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:26,173 INFO L791 eck$LassoCheckResult]: Stem: 2546#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 2548#L561 assume !(main_~array_size~0#1 < 1); 2549#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 2537#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2538#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2539#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2540#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2550#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2560#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2558#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2559#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2579#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2557#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2556#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2555#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 2553#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2543#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2544#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 2551#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 2552#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2571#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2570#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 2569#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 2568#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2566#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2564#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 2563#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 2561#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2541#L552-3 [2021-12-16 09:27:26,173 INFO L793 eck$LassoCheckResult]: Loop: 2541#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2542#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2541#L552-3 [2021-12-16 09:27:26,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:26,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1528280583, now seen corresponding path program 8 times [2021-12-16 09:27:26,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:26,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435865651] [2021-12-16 09:27:26,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:26,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:26,198 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:26,226 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:26,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:26,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 8 times [2021-12-16 09:27:26,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:26,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706474136] [2021-12-16 09:27:26,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:26,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:26,232 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:26,240 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:26,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:26,241 INFO L85 PathProgramCache]: Analyzing trace with hash -201173812, now seen corresponding path program 4 times [2021-12-16 09:27:26,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:26,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431360160] [2021-12-16 09:27:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:26,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:26,263 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:26,284 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:27,055 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:27:27,055 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:27:27,055 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:27:27,055 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:27:27,055 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:27:27,055 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:27,055 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:27:27,056 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:27:27,056 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration11_Lasso [2021-12-16 09:27:27,056 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:27:27,056 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:27:27,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:27,715 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:27:27,715 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:27:27,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:27,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:27,716 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:27,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-12-16 09:27:27,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:27,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:27,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:27,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:27,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:27,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:27,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:27,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:27,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:27,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:27,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:27,742 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:27,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-12-16 09:27:27,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:27,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:27,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:27,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:27,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:27,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:27,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:27,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:27,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:27,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:27,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:27,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:27,767 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:27,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-12-16 09:27:27,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:27,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:27,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:27,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:27,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:27,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:27,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:27,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:27,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:27,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2021-12-16 09:27:27,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:27,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:27,791 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:27,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-12-16 09:27:27,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:27,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:27,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:27,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:27,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:27,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:27,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:27,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:27,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:27,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:27,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:27,817 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:27,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-12-16 09:27:27,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:27,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:27,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:27,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:27,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:27,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:27,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:27,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:27,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2021-12-16 09:27:27,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:27,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:27,844 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:27,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-12-16 09:27:27,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:27,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:27,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:27,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:27,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:27,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:27,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:27,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:27,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:27,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2021-12-16 09:27:27,867 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:27,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:27,868 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:27,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2021-12-16 09:27:27,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:27,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:27,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:27,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:27,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:27,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:27,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:27,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:27,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2021-12-16 09:27:27,898 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:27,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:27,899 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:27,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2021-12-16 09:27:27,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:27,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:27,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:27,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:27,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:27,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:27,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:27,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:27,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:27,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:27,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:27,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:27,926 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:27,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2021-12-16 09:27:27,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:27,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:27,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:27,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:27,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:27,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:27,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:27,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:27,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:27,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2021-12-16 09:27:27,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:27,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:27,951 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:27,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2021-12-16 09:27:27,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:27,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:27,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:27,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:27,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:27,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:27,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:27,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:27,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:27,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2021-12-16 09:27:27,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:27,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:27,978 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:27,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2021-12-16 09:27:27,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:27,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:27,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:27,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:27,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:27,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:27,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:27,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:28,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:28,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:28,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:28,007 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:28,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2021-12-16 09:27:28,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:28,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:28,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:28,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:28,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:28,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:28,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:28,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:28,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2021-12-16 09:27:28,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:28,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:28,039 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:28,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2021-12-16 09:27:28,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:28,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:28,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:28,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:28,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:28,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:28,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:28,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:28,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2021-12-16 09:27:28,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:28,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:28,070 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:28,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2021-12-16 09:27:28,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:28,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:28,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:28,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:28,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:28,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:28,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:28,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:28,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2021-12-16 09:27:28,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:28,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:28,125 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:28,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2021-12-16 09:27:28,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:28,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:28,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:28,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:28,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:28,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:28,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:28,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:28,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2021-12-16 09:27:28,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:28,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:28,155 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:28,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2021-12-16 09:27:28,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:28,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:28,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:28,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:28,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:28,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:28,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:28,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:28,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2021-12-16 09:27:28,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:28,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:28,221 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:28,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2021-12-16 09:27:28,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:28,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:28,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:28,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:28,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:28,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:28,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:28,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:28,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2021-12-16 09:27:28,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:28,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:28,255 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:28,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2021-12-16 09:27:28,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:28,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:28,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:28,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:28,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:28,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:28,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:28,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:28,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2021-12-16 09:27:28,296 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:28,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:28,296 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:28,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2021-12-16 09:27:28,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:28,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:28,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:28,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:28,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:28,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:28,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:28,335 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:27:28,342 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-16 09:27:28,342 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-16 09:27:28,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:28,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:28,344 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:28,351 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:27:28,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2021-12-16 09:27:28,373 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 09:27:28,373 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:27:28,373 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 12))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 12))_1 Supporting invariants [] [2021-12-16 09:27:28,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:28,481 INFO L297 tatePredicateManager]: 38 out of 40 supporting invariants were superfluous and have been removed [2021-12-16 09:27:28,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:28,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-16 09:27:28,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:28,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:28,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:28,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:28,748 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2021-12-16 09:27:28,749 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 51 transitions. cyclomatic complexity: 15 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:28,773 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 51 transitions. cyclomatic complexity: 15. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 55 transitions. Complement of second has 4 states. [2021-12-16 09:27:28,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-16 09:27:28,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 29 letters. Loop has 2 letters. [2021-12-16 09:27:28,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:28,775 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:28,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-16 09:27:28,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:28,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:28,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:28,996 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2021-12-16 09:27:28,996 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 51 transitions. cyclomatic complexity: 15 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:29,015 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 51 transitions. cyclomatic complexity: 15. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 55 transitions. Complement of second has 4 states. [2021-12-16 09:27:29,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-16 09:27:29,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 29 letters. Loop has 2 letters. [2021-12-16 09:27:29,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:29,016 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:29,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:29,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-16 09:27:29,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:29,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:29,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:29,265 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2021-12-16 09:27:29,265 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 51 transitions. cyclomatic complexity: 15 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:29,352 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 51 transitions. cyclomatic complexity: 15. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 99 transitions. Complement of second has 14 states. [2021-12-16 09:27:29,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-16 09:27:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2021-12-16 09:27:29,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 29 letters. Loop has 2 letters. [2021-12-16 09:27:29,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:29,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 31 letters. Loop has 2 letters. [2021-12-16 09:27:29,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:29,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 29 letters. Loop has 4 letters. [2021-12-16 09:27:29,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:29,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 99 transitions. [2021-12-16 09:27:29,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:29,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 89 transitions. [2021-12-16 09:27:29,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-16 09:27:29,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-16 09:27:29,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 89 transitions. [2021-12-16 09:27:29,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:29,356 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 89 transitions. [2021-12-16 09:27:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 89 transitions. [2021-12-16 09:27:29,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2021-12-16 09:27:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2021-12-16 09:27:29,359 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-16 09:27:29,359 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-16 09:27:29,359 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-16 09:27:29,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2021-12-16 09:27:29,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:29,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:29,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:29,360 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:29,361 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:29,361 INFO L791 eck$LassoCheckResult]: Stem: 3262#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3263#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 3264#L561 assume !(main_~array_size~0#1 < 1); 3265#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 3266#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3267#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3268#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3269#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3272#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3284#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3283#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3281#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3280#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3276#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 3273#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3274#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3294#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3293#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3275#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3259#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3260#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3270#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3271#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3291#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3290#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3289#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3288#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3285#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3282#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3279#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3277#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3257#L552-3 [2021-12-16 09:27:29,361 INFO L793 eck$LassoCheckResult]: Loop: 3257#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3258#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3257#L552-3 [2021-12-16 09:27:29,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:29,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1693390338, now seen corresponding path program 9 times [2021-12-16 09:27:29,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:29,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870971781] [2021-12-16 09:27:29,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:29,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:29,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:27:29,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870971781] [2021-12-16 09:27:29,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870971781] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:27:29,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786791291] [2021-12-16 09:27:29,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 09:27:29,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:27:29,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:29,461 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:27:29,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2021-12-16 09:27:29,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-16 09:27:29,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:27:29,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 09:27:29,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:29,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:27:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:29,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786791291] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:27:29,746 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:27:29,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2021-12-16 09:27:29,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563846049] [2021-12-16 09:27:29,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:27:29,750 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:27:29,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:29,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 9 times [2021-12-16 09:27:29,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:29,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807755215] [2021-12-16 09:27:29,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:29,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:29,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:29,758 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:29,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:27:29,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-16 09:27:29,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-12-16 09:27:29,789 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 14 Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:27:29,924 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2021-12-16 09:27:29,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 09:27:29,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 75 transitions. [2021-12-16 09:27:29,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:29,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 42 states and 49 transitions. [2021-12-16 09:27:29,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-16 09:27:29,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-16 09:27:29,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2021-12-16 09:27:29,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:29,925 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2021-12-16 09:27:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2021-12-16 09:27:29,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-12-16 09:27:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.170731707317073) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2021-12-16 09:27:29,927 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2021-12-16 09:27:29,927 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2021-12-16 09:27:29,927 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-16 09:27:29,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2021-12-16 09:27:29,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:29,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:29,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:29,928 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:29,928 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:29,929 INFO L791 eck$LassoCheckResult]: Stem: 3580#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3581#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 3582#L561 assume !(main_~array_size~0#1 < 1); 3583#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 3584#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3585#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3586#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3587#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3604#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3603#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3602#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3601#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3600#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3598#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3597#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3592#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 3590#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3577#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3578#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3588#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3589#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3591#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3614#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3613#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3612#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3610#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3609#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3608#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3607#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3606#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3596#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3595#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3593#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3575#L552-3 [2021-12-16 09:27:29,929 INFO L793 eck$LassoCheckResult]: Loop: 3575#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3576#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3575#L552-3 [2021-12-16 09:27:29,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:29,929 INFO L85 PathProgramCache]: Analyzing trace with hash -54505508, now seen corresponding path program 10 times [2021-12-16 09:27:29,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:29,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24600776] [2021-12-16 09:27:29,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:29,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:29,943 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:29,955 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:29,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:29,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 10 times [2021-12-16 09:27:29,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:29,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363189684] [2021-12-16 09:27:29,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:29,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:29,959 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:29,961 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:29,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash -840184479, now seen corresponding path program 5 times [2021-12-16 09:27:29,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:29,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379695746] [2021-12-16 09:27:29,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:29,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:29,977 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:29,998 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:30,837 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:27:30,837 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:27:30,837 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:27:30,837 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:27:30,837 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:27:30,837 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:30,837 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:27:30,837 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:27:30,837 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration13_Lasso [2021-12-16 09:27:30,838 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:27:30,838 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:27:30,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:30,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:31,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:31,667 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:27:31,667 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:27:31,667 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:31,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:31,672 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:31,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2021-12-16 09:27:31,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:31,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:31,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:31,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:31,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:31,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:31,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:31,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:31,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:31,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2021-12-16 09:27:31,717 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:31,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:31,718 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:31,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2021-12-16 09:27:31,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:31,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:31,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:31,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:31,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:31,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:31,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:31,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:31,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2021-12-16 09:27:31,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:31,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:31,745 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:31,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2021-12-16 09:27:31,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:31,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:31,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:31,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:31,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:31,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:31,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:31,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:31,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:31,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2021-12-16 09:27:31,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:31,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:31,770 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:31,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2021-12-16 09:27:31,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:31,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:31,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:31,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:31,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:31,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:31,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:31,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:31,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2021-12-16 09:27:31,797 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:31,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:31,798 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:31,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2021-12-16 09:27:31,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:31,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:31,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:31,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:31,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:31,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:31,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:31,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:31,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:31,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2021-12-16 09:27:31,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:31,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:31,823 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:31,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2021-12-16 09:27:31,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:31,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:31,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:31,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:31,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:31,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:31,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:31,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:31,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2021-12-16 09:27:31,855 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:31,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:31,856 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:31,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2021-12-16 09:27:31,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:31,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:31,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:31,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:31,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:31,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:31,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:31,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:31,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:31,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2021-12-16 09:27:31,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:31,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:31,882 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:31,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2021-12-16 09:27:31,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:31,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:31,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:31,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:31,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:31,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:31,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:31,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:31,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:31,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2021-12-16 09:27:31,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:31,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:31,907 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:31,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2021-12-16 09:27:31,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:31,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:31,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:31,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:31,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:31,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:31,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:31,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:31,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:31,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:31,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:31,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:31,933 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:31,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2021-12-16 09:27:31,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:31,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:31,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:31,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:31,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:31,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:31,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:31,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:31,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2021-12-16 09:27:31,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:31,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:31,968 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:31,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2021-12-16 09:27:31,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:31,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:31,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:31,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:31,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:31,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:31,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:31,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:31,977 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:31,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2021-12-16 09:27:31,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:31,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:31,992 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:31,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2021-12-16 09:27:31,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:32,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:32,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:32,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:32,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:32,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:32,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:32,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:32,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:32,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2021-12-16 09:27:32,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:32,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:32,017 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:32,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2021-12-16 09:27:32,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:32,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:32,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:32,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:32,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:32,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:32,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:32,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:32,026 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:32,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2021-12-16 09:27:32,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:32,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:32,042 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:32,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2021-12-16 09:27:32,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:32,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:32,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:32,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:32,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:32,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:32,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:32,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:32,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2021-12-16 09:27:32,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:32,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:32,068 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:32,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2021-12-16 09:27:32,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:32,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:32,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:32,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:32,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:32,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:32,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:32,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:32,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:32,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2021-12-16 09:27:32,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:32,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:32,093 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:32,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2021-12-16 09:27:32,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:32,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:32,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:32,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:32,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:32,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:32,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:32,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:32,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:32,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2021-12-16 09:27:32,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:32,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:32,118 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:32,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2021-12-16 09:27:32,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:32,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:32,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:32,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:32,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:32,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:32,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:32,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:32,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:32,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:32,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:32,156 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:32,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2021-12-16 09:27:32,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:32,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:32,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:32,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:32,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:32,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:32,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:32,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:32,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2021-12-16 09:27:32,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:32,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:32,185 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:32,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2021-12-16 09:27:32,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:32,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:32,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:32,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:32,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:32,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:32,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:32,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:32,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:32,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:32,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:32,216 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:32,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2021-12-16 09:27:32,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:32,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:32,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:32,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:32,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:32,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:32,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:32,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:32,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:32,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:32,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:32,247 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:32,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2021-12-16 09:27:32,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:32,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:32,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:32,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:32,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:32,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:32,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:32,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:32,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2021-12-16 09:27:32,276 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:32,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:32,276 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:32,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2021-12-16 09:27:32,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:32,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:32,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:32,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:32,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:32,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:32,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:32,290 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:27:32,295 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-16 09:27:32,295 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-16 09:27:32,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:32,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:32,296 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:32,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2021-12-16 09:27:32,298 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:27:32,304 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 09:27:32,305 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:27:32,305 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset (* ULTIMATE.start_main_~i~1#1 4) (- 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset (* ULTIMATE.start_main_~i~1#1 4) (- 4)))_1 Supporting invariants [] [2021-12-16 09:27:32,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:32,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:32,438 INFO L297 tatePredicateManager]: 47 out of 49 supporting invariants were superfluous and have been removed [2021-12-16 09:27:32,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:32,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-16 09:27:32,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:32,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:32,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:32,853 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2021-12-16 09:27:32,853 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14 Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:32,951 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 56 transitions. Complement of second has 10 states. [2021-12-16 09:27:32,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 8 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2021-12-16 09:27:32,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 33 letters. Loop has 2 letters. [2021-12-16 09:27:32,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:32,952 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:32,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:32,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-16 09:27:32,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:33,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:33,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:33,378 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2021-12-16 09:27:33,379 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14 Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:33,452 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 56 transitions. Complement of second has 10 states. [2021-12-16 09:27:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 8 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:33,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2021-12-16 09:27:33,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 33 letters. Loop has 2 letters. [2021-12-16 09:27:33,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:33,454 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:33,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-16 09:27:33,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:33,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:33,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:33,912 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2021-12-16 09:27:33,912 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14 Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:34,125 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 95 states and 120 transitions. Complement of second has 23 states. [2021-12-16 09:27:34,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-16 09:27:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2021-12-16 09:27:34,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 33 letters. Loop has 2 letters. [2021-12-16 09:27:34,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:34,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 35 letters. Loop has 2 letters. [2021-12-16 09:27:34,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:34,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 33 letters. Loop has 4 letters. [2021-12-16 09:27:34,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:34,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 120 transitions. [2021-12-16 09:27:34,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-16 09:27:34,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 90 states and 113 transitions. [2021-12-16 09:27:34,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-16 09:27:34,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-16 09:27:34,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 113 transitions. [2021-12-16 09:27:34,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:34,131 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 113 transitions. [2021-12-16 09:27:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 113 transitions. [2021-12-16 09:27:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 50. [2021-12-16 09:27:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.18) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2021-12-16 09:27:34,134 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2021-12-16 09:27:34,134 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2021-12-16 09:27:34,134 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-16 09:27:34,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 59 transitions. [2021-12-16 09:27:34,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:34,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:34,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:34,135 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:34,136 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:34,136 INFO L791 eck$LassoCheckResult]: Stem: 4452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4453#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 4454#L561 assume !(main_~array_size~0#1 < 1); 4455#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 4456#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 4457#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4458#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 4459#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4472#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 4471#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4470#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 4469#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4467#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 4468#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4496#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 4466#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4465#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4464#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 4462#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4449#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4450#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 4460#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 4461#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4488#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4487#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 4486#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 4485#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4483#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4482#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 4481#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 4480#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4479#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4476#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 4475#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 4473#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4447#L552-3 [2021-12-16 09:27:34,136 INFO L793 eck$LassoCheckResult]: Loop: 4447#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4448#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4447#L552-3 [2021-12-16 09:27:34,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1339181510, now seen corresponding path program 11 times [2021-12-16 09:27:34,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:34,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237271650] [2021-12-16 09:27:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:34,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:34,150 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:34,162 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:34,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:34,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 11 times [2021-12-16 09:27:34,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:34,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430543979] [2021-12-16 09:27:34,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:34,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:34,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:34,168 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:34,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:34,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1536758847, now seen corresponding path program 6 times [2021-12-16 09:27:34,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:34,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898140563] [2021-12-16 09:27:34,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:34,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:34,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:34,196 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:35,299 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:27:35,300 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:27:35,300 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:27:35,300 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:27:35,300 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:27:35,300 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:35,300 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:27:35,300 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:27:35,300 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration14_Lasso [2021-12-16 09:27:35,300 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:27:35,300 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:27:35,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:35,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:36,081 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:27:36,082 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:27:36,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:36,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:36,084 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:36,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2021-12-16 09:27:36,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:36,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:36,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:36,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:36,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:36,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:36,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:36,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:36,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:36,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2021-12-16 09:27:36,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:36,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:36,109 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:36,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2021-12-16 09:27:36,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:36,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:36,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:36,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:36,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:36,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:36,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:36,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:36,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2021-12-16 09:27:36,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:36,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:36,136 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:36,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2021-12-16 09:27:36,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:36,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:36,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:36,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:36,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:36,145 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:36,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:36,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:36,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2021-12-16 09:27:36,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:36,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:36,163 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:36,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2021-12-16 09:27:36,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:36,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:36,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:36,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:36,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:36,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:36,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:36,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:36,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:36,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2021-12-16 09:27:36,186 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:36,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:36,187 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:36,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2021-12-16 09:27:36,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:36,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:36,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:36,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:36,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:36,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:36,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:36,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:36,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2021-12-16 09:27:36,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:36,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:36,216 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:36,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2021-12-16 09:27:36,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:36,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:36,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:36,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:36,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:36,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:36,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:36,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:36,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2021-12-16 09:27:36,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:36,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:36,245 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:36,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2021-12-16 09:27:36,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:36,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:36,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:36,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:36,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:36,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:36,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:36,258 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:36,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2021-12-16 09:27:36,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:36,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:36,275 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:36,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2021-12-16 09:27:36,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:36,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:36,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:36,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:36,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:36,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:36,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:36,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:36,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:36,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:36,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:36,312 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:36,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2021-12-16 09:27:36,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:36,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:36,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:36,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:36,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:36,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:36,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:36,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:36,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2021-12-16 09:27:36,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:36,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:36,341 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:36,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2021-12-16 09:27:36,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:36,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:36,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:36,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:36,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:36,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:36,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:36,354 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:36,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2021-12-16 09:27:36,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:36,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:36,369 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:36,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2021-12-16 09:27:36,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:36,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:36,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:36,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:36,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:36,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:36,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:36,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:36,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:36,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:36,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:36,425 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:36,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2021-12-16 09:27:36,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:36,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:36,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:36,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:36,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:36,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:36,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:36,441 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:27:36,447 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-16 09:27:36,447 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-16 09:27:36,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:36,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:36,448 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:36,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2021-12-16 09:27:36,450 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:27:36,456 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 09:27:36,456 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:27:36,456 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 16))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 16))_2 Supporting invariants [] [2021-12-16 09:27:36,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:36,591 INFO L297 tatePredicateManager]: 57 out of 59 supporting invariants were superfluous and have been removed [2021-12-16 09:27:36,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:36,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-16 09:27:36,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:36,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:36,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:36,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:36,870 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2021-12-16 09:27:36,870 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 59 transitions. cyclomatic complexity: 17 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:36,891 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 59 transitions. cyclomatic complexity: 17. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 52 states and 63 transitions. Complement of second has 4 states. [2021-12-16 09:27:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-16 09:27:36,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 35 letters. Loop has 2 letters. [2021-12-16 09:27:36,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:36,893 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:36,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:36,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-16 09:27:36,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:37,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:37,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:37,181 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2021-12-16 09:27:37,181 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 59 transitions. cyclomatic complexity: 17 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:37,206 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 59 transitions. cyclomatic complexity: 17. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 52 states and 63 transitions. Complement of second has 4 states. [2021-12-16 09:27:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-16 09:27:37,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 35 letters. Loop has 2 letters. [2021-12-16 09:27:37,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:37,208 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:37,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:37,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-16 09:27:37,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:37,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:37,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:37,515 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2021-12-16 09:27:37,515 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 59 transitions. cyclomatic complexity: 17 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:37,624 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 59 transitions. cyclomatic complexity: 17. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 92 states and 117 transitions. Complement of second has 16 states. [2021-12-16 09:27:37,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-16 09:27:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2021-12-16 09:27:37,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 35 letters. Loop has 2 letters. [2021-12-16 09:27:37,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:37,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 37 letters. Loop has 2 letters. [2021-12-16 09:27:37,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:37,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 35 letters. Loop has 4 letters. [2021-12-16 09:27:37,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:37,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 117 transitions. [2021-12-16 09:27:37,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:37,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 85 states and 107 transitions. [2021-12-16 09:27:37,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-16 09:27:37,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-16 09:27:37,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 107 transitions. [2021-12-16 09:27:37,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:37,628 INFO L681 BuchiCegarLoop]: Abstraction has 85 states and 107 transitions. [2021-12-16 09:27:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 107 transitions. [2021-12-16 09:27:37,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2021-12-16 09:27:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2021-12-16 09:27:37,630 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2021-12-16 09:27:37,630 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2021-12-16 09:27:37,630 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-16 09:27:37,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2021-12-16 09:27:37,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:37,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:37,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:37,631 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:37,631 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:37,631 INFO L791 eck$LassoCheckResult]: Stem: 5343#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5344#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 5345#L561 assume !(main_~array_size~0#1 < 1); 5346#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 5347#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 5348#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5349#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 5350#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5353#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 5367#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5366#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 5365#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5364#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 5362#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5361#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5357#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 5354#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5355#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5382#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5381#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5356#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5340#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5341#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5351#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5352#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5379#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5378#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5377#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5376#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5374#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5373#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5372#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5371#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5368#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5363#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5360#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5358#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5338#L552-3 [2021-12-16 09:27:37,631 INFO L793 eck$LassoCheckResult]: Loop: 5338#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5339#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5338#L552-3 [2021-12-16 09:27:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash 36566833, now seen corresponding path program 12 times [2021-12-16 09:27:37,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:37,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657885912] [2021-12-16 09:27:37,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:37,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:37,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:27:37,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657885912] [2021-12-16 09:27:37,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657885912] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:27:37,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482855314] [2021-12-16 09:27:37,742 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-16 09:27:37,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:27:37,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:37,743 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:27:37,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2021-12-16 09:27:37,813 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-16 09:27:37,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:27:37,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-16 09:27:37,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:37,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:27:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:38,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482855314] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:27:38,053 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:27:38,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2021-12-16 09:27:38,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423127259] [2021-12-16 09:27:38,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:27:38,054 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:27:38,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:38,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 12 times [2021-12-16 09:27:38,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:38,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023149402] [2021-12-16 09:27:38,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:38,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:38,058 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:38,060 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:38,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:27:38,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-16 09:27:38,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2021-12-16 09:27:38,103 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 16 Second operand has 23 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:27:38,270 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2021-12-16 09:27:38,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 09:27:38,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 89 transitions. [2021-12-16 09:27:38,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:38,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 49 states and 57 transitions. [2021-12-16 09:27:38,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-16 09:27:38,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-16 09:27:38,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 57 transitions. [2021-12-16 09:27:38,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:38,271 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2021-12-16 09:27:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 57 transitions. [2021-12-16 09:27:38,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2021-12-16 09:27:38,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2021-12-16 09:27:38,273 INFO L704 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2021-12-16 09:27:38,273 INFO L587 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2021-12-16 09:27:38,273 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-16 09:27:38,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 56 transitions. [2021-12-16 09:27:38,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:38,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:38,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:38,274 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:38,274 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:38,274 INFO L791 eck$LassoCheckResult]: Stem: 5725#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5726#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 5727#L561 assume !(main_~array_size~0#1 < 1); 5728#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 5716#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 5717#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5718#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 5719#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5747#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 5746#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5745#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 5744#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5743#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 5742#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5741#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 5738#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5737#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5733#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 5731#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5722#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5723#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5729#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5730#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5732#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5762#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5761#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5760#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5758#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5757#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5756#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5755#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5753#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5752#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5751#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5750#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5749#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5739#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5736#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5734#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5720#L552-3 [2021-12-16 09:27:38,274 INFO L793 eck$LassoCheckResult]: Loop: 5720#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5721#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5720#L552-3 [2021-12-16 09:27:38,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:38,275 INFO L85 PathProgramCache]: Analyzing trace with hash -643498353, now seen corresponding path program 13 times [2021-12-16 09:27:38,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:38,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258767659] [2021-12-16 09:27:38,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:38,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:38,286 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:38,305 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:38,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:38,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 13 times [2021-12-16 09:27:38,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:38,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168721774] [2021-12-16 09:27:38,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:38,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:38,309 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:38,311 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:38,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:38,312 INFO L85 PathProgramCache]: Analyzing trace with hash 73374548, now seen corresponding path program 7 times [2021-12-16 09:27:38,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:38,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341273714] [2021-12-16 09:27:38,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:38,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:38,325 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:38,338 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:39,696 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:27:39,697 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:27:39,697 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:27:39,697 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:27:39,697 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:27:39,697 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:39,697 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:27:39,697 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:27:39,697 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration16_Lasso [2021-12-16 09:27:39,697 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:27:39,697 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:27:39,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:39,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:39,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:39,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:40,624 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:27:40,624 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:27:40,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:40,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:40,626 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:40,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2021-12-16 09:27:40,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:40,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:40,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:40,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:40,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:40,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:40,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:40,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:40,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:40,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:40,666 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:40,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2021-12-16 09:27:40,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:40,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:40,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:40,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:40,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:40,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:40,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:40,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:40,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:40,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2021-12-16 09:27:40,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:40,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:40,691 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:40,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2021-12-16 09:27:40,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:40,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:40,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:40,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:40,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:40,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:40,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:40,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:40,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2021-12-16 09:27:40,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:40,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:40,718 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:40,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2021-12-16 09:27:40,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:40,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:40,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:40,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:40,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:40,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:40,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:40,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:40,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2021-12-16 09:27:40,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:40,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:40,748 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:40,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2021-12-16 09:27:40,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:40,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:40,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:40,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:40,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:40,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:40,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:40,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:40,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2021-12-16 09:27:40,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:40,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:40,778 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:40,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2021-12-16 09:27:40,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:40,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:40,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:40,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:40,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:40,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:40,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:40,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:40,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2021-12-16 09:27:40,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:40,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:40,808 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:40,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2021-12-16 09:27:40,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:40,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:40,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:40,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:40,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:40,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:40,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:40,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:40,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2021-12-16 09:27:40,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:40,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:40,837 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:40,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2021-12-16 09:27:40,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:40,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:40,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:40,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:40,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:40,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:40,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:40,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:40,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2021-12-16 09:27:40,866 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:40,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:40,867 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:40,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2021-12-16 09:27:40,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:40,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:40,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:40,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:40,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:40,876 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:40,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:40,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:40,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2021-12-16 09:27:40,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:40,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:40,896 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:40,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2021-12-16 09:27:40,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:40,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:40,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:40,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:40,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:40,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:40,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:40,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:40,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:40,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:40,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:40,953 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:40,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2021-12-16 09:27:40,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:40,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:40,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:40,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:40,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:40,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:40,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:40,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:41,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2021-12-16 09:27:41,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:41,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:41,014 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:41,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2021-12-16 09:27:41,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:41,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:41,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:41,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:41,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:41,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:41,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:41,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:41,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2021-12-16 09:27:41,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:41,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:41,045 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:41,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2021-12-16 09:27:41,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:41,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:41,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:41,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:41,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:41,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:41,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:41,059 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:27:41,065 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-16 09:27:41,065 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-16 09:27:41,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:41,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:41,066 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:41,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2021-12-16 09:27:41,067 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:27:41,074 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 09:27:41,074 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:27:41,074 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset (* ULTIMATE.start_main_~i~1#1 4) (- 4)))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset (* ULTIMATE.start_main_~i~1#1 4) (- 4)))_2 Supporting invariants [] [2021-12-16 09:27:41,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2021-12-16 09:27:41,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:41,252 INFO L297 tatePredicateManager]: 69 out of 71 supporting invariants were superfluous and have been removed [2021-12-16 09:27:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:41,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-16 09:27:41,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:41,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:41,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:41,728 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2021-12-16 09:27:41,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16 Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:41,825 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 54 states and 64 transitions. Complement of second has 11 states. [2021-12-16 09:27:41,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2021-12-16 09:27:41,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 26 transitions. Stem has 39 letters. Loop has 2 letters. [2021-12-16 09:27:41,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:41,827 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:41,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:41,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-16 09:27:41,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:42,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:42,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:42,315 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.14 stem predicates 2 loop predicates [2021-12-16 09:27:42,315 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16 Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:42,411 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 54 states and 64 transitions. Complement of second has 11 states. [2021-12-16 09:27:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2021-12-16 09:27:42,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 26 transitions. Stem has 39 letters. Loop has 2 letters. [2021-12-16 09:27:42,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:42,416 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:42,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:42,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-16 09:27:42,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:42,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:42,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:42,961 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2021-12-16 09:27:42,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16 Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:43,210 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 109 states and 138 transitions. Complement of second has 26 states. [2021-12-16 09:27:43,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 14 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-16 09:27:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 75 transitions. [2021-12-16 09:27:43,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 75 transitions. Stem has 39 letters. Loop has 2 letters. [2021-12-16 09:27:43,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:43,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 75 transitions. Stem has 41 letters. Loop has 2 letters. [2021-12-16 09:27:43,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:43,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 75 transitions. Stem has 39 letters. Loop has 4 letters. [2021-12-16 09:27:43,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:43,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 138 transitions. [2021-12-16 09:27:43,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-16 09:27:43,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 104 states and 131 transitions. [2021-12-16 09:27:43,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-16 09:27:43,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-16 09:27:43,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 131 transitions. [2021-12-16 09:27:43,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:43,215 INFO L681 BuchiCegarLoop]: Abstraction has 104 states and 131 transitions. [2021-12-16 09:27:43,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 131 transitions. [2021-12-16 09:27:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 57. [2021-12-16 09:27:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 56 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2021-12-16 09:27:43,217 INFO L704 BuchiCegarLoop]: Abstraction has 57 states and 67 transitions. [2021-12-16 09:27:43,217 INFO L587 BuchiCegarLoop]: Abstraction has 57 states and 67 transitions. [2021-12-16 09:27:43,217 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-16 09:27:43,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 67 transitions. [2021-12-16 09:27:43,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:43,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:43,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:43,218 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:43,219 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:43,219 INFO L791 eck$LassoCheckResult]: Stem: 6789#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6790#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 6791#L561 assume !(main_~array_size~0#1 < 1); 6792#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 6780#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 6781#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6782#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 6783#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6793#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 6807#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6806#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 6805#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6804#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 6803#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6801#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 6802#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6836#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 6800#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6799#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6798#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 6796#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6786#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6787#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6794#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6795#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6828#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6827#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6826#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6825#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6823#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6822#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6821#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6820#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6818#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6817#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6816#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6815#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6814#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6811#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6810#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6808#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6784#L552-3 [2021-12-16 09:27:43,219 INFO L793 eck$LassoCheckResult]: Loop: 6784#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6785#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6784#L552-3 [2021-12-16 09:27:43,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:43,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1351113107, now seen corresponding path program 14 times [2021-12-16 09:27:43,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:43,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930933542] [2021-12-16 09:27:43,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:43,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:43,233 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:43,246 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:43,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:43,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 14 times [2021-12-16 09:27:43,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:43,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715603394] [2021-12-16 09:27:43,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:43,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:43,251 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:43,253 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:43,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:43,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1339571278, now seen corresponding path program 8 times [2021-12-16 09:27:43,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:43,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472538589] [2021-12-16 09:27:43,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:43,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:43,267 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:43,281 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:45,126 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:27:45,126 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:27:45,126 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:27:45,126 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:27:45,126 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:27:45,126 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:45,126 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:27:45,126 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:27:45,126 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration17_Lasso [2021-12-16 09:27:45,126 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:27:45,126 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:27:45,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:45,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:46,046 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:27:46,047 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:27:46,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:46,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:46,049 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:46,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2021-12-16 09:27:46,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:46,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:46,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:46,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:46,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:46,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:46,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:46,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:46,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:46,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2021-12-16 09:27:46,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:46,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:46,073 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:46,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2021-12-16 09:27:46,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:46,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:46,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:46,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:46,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:46,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:46,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:46,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:46,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2021-12-16 09:27:46,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:46,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:46,100 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:46,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2021-12-16 09:27:46,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:46,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:46,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:46,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:46,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:46,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:46,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:46,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:46,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:46,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:46,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:46,130 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:46,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2021-12-16 09:27:46,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:46,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:46,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:46,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:46,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:46,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:46,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:46,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:46,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2021-12-16 09:27:46,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:46,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:46,157 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:46,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2021-12-16 09:27:46,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:46,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:46,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:46,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:46,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:46,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:46,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:46,192 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:27:46,198 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-16 09:27:46,198 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-16 09:27:46,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:46,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:46,199 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:46,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2021-12-16 09:27:46,201 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:27:46,206 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 09:27:46,206 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:27:46,207 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 20))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 20))_2 Supporting invariants [] [2021-12-16 09:27:46,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:46,384 INFO L297 tatePredicateManager]: 81 out of 83 supporting invariants were superfluous and have been removed [2021-12-16 09:27:46,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:46,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2021-12-16 09:27:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:46,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-16 09:27:46,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:46,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:46,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:46,709 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2021-12-16 09:27:46,710 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 67 transitions. cyclomatic complexity: 19 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:46,732 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 67 transitions. cyclomatic complexity: 19. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 59 states and 71 transitions. Complement of second has 4 states. [2021-12-16 09:27:46,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-16 09:27:46,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 41 letters. Loop has 2 letters. [2021-12-16 09:27:46,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:46,733 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:46,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:46,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-16 09:27:46,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:47,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:47,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:47,092 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2021-12-16 09:27:47,092 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 67 transitions. cyclomatic complexity: 19 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:47,119 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 67 transitions. cyclomatic complexity: 19. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 59 states and 71 transitions. Complement of second has 4 states. [2021-12-16 09:27:47,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-16 09:27:47,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 41 letters. Loop has 2 letters. [2021-12-16 09:27:47,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:47,120 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:47,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:47,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-16 09:27:47,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:47,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:47,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:47,470 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2021-12-16 09:27:47,471 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 67 transitions. cyclomatic complexity: 19 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:47,593 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 67 transitions. cyclomatic complexity: 19. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 106 states and 135 transitions. Complement of second has 18 states. [2021-12-16 09:27:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-16 09:27:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:47,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2021-12-16 09:27:47,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 41 letters. Loop has 2 letters. [2021-12-16 09:27:47,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:47,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 43 letters. Loop has 2 letters. [2021-12-16 09:27:47,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:47,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 41 letters. Loop has 4 letters. [2021-12-16 09:27:47,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:47,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 135 transitions. [2021-12-16 09:27:47,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:47,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 99 states and 125 transitions. [2021-12-16 09:27:47,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-16 09:27:47,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-16 09:27:47,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 125 transitions. [2021-12-16 09:27:47,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:47,597 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 125 transitions. [2021-12-16 09:27:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 125 transitions. [2021-12-16 09:27:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 53. [2021-12-16 09:27:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.169811320754717) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2021-12-16 09:27:47,599 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-12-16 09:27:47,599 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-12-16 09:27:47,600 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-16 09:27:47,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2021-12-16 09:27:47,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:47,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:47,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:47,601 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:47,601 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:47,601 INFO L791 eck$LassoCheckResult]: Stem: 7862#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7863#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 7864#L561 assume !(main_~array_size~0#1 < 1); 7865#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 7866#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 7867#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7868#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 7869#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7875#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 7893#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7892#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 7891#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7890#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 7889#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7888#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 7887#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7886#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 7881#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 7878#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7879#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7913#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 7912#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 7880#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7872#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7873#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 7876#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 7877#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7910#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7909#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 7908#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 7907#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7905#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7904#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 7903#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 7902#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7900#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7899#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 7898#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 7897#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7894#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7885#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 7884#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 7882#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7870#L552-3 [2021-12-16 09:27:47,601 INFO L793 eck$LassoCheckResult]: Loop: 7870#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7871#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7870#L552-3 [2021-12-16 09:27:47,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1793463396, now seen corresponding path program 15 times [2021-12-16 09:27:47,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:47,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953766721] [2021-12-16 09:27:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:47,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 45 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:47,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:27:47,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953766721] [2021-12-16 09:27:47,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953766721] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:27:47,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439993653] [2021-12-16 09:27:47,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 09:27:47,740 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:27:47,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:47,744 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:27:47,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Waiting until timeout for monitored process [2021-12-16 09:27:47,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-12-16 09:27:47,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:27:47,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-16 09:27:47,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:48,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:27:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:48,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439993653] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:27:48,150 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:27:48,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2021-12-16 09:27:48,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424482612] [2021-12-16 09:27:48,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:27:48,151 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:27:48,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:48,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 15 times [2021-12-16 09:27:48,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:48,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122836368] [2021-12-16 09:27:48,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:48,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:48,154 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:48,156 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:48,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:27:48,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-16 09:27:48,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2021-12-16 09:27:48,196 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 18 Second operand has 26 states, 25 states have (on average 3.08) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:27:48,372 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2021-12-16 09:27:48,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 09:27:48,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 103 transitions. [2021-12-16 09:27:48,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:48,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 56 states and 65 transitions. [2021-12-16 09:27:48,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-16 09:27:48,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-16 09:27:48,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 65 transitions. [2021-12-16 09:27:48,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:48,374 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 65 transitions. [2021-12-16 09:27:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 65 transitions. [2021-12-16 09:27:48,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2021-12-16 09:27:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2021-12-16 09:27:48,376 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-12-16 09:27:48,376 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-12-16 09:27:48,376 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-12-16 09:27:48,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 64 transitions. [2021-12-16 09:27:48,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:48,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:48,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:48,377 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:48,377 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:48,377 INFO L791 eck$LassoCheckResult]: Stem: 8300#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 8302#L561 assume !(main_~array_size~0#1 < 1); 8303#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 8304#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 8305#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8306#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 8307#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8333#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 8332#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8331#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 8330#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8329#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 8328#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8327#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 8326#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8325#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 8323#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8322#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 8317#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 8315#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8310#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8311#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8313#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 8314#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8316#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8353#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8352#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 8351#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8349#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8348#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8347#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 8346#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8344#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8343#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8342#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 8341#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8339#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8338#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8337#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 8336#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8335#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8321#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8320#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 8318#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8308#L552-3 [2021-12-16 09:27:48,378 INFO L793 eck$LassoCheckResult]: Loop: 8308#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8309#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8308#L552-3 [2021-12-16 09:27:48,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:48,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1162190146, now seen corresponding path program 16 times [2021-12-16 09:27:48,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:48,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925205375] [2021-12-16 09:27:48,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:48,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:48,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:48,408 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:48,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 16 times [2021-12-16 09:27:48,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:48,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281066846] [2021-12-16 09:27:48,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:48,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:48,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:48,415 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:48,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash 173234503, now seen corresponding path program 9 times [2021-12-16 09:27:48,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:48,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986061179] [2021-12-16 09:27:48,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:48,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:48,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:48,449 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:50,058 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:27:50,058 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:27:50,058 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:27:50,058 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:27:50,058 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:27:50,058 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:50,058 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:27:50,058 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:27:50,059 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration19_Lasso [2021-12-16 09:27:50,059 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:27:50,059 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:27:50,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:50,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:51,003 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:27:51,004 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:27:51,004 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:51,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:51,008 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:51,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2021-12-16 09:27:51,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:51,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:51,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:51,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:51,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:51,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:51,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:51,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:51,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:51,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2021-12-16 09:27:51,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:51,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:51,082 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:51,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2021-12-16 09:27:51,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:51,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:51,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:51,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:51,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:51,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:51,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:51,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:51,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2021-12-16 09:27:51,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:51,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:51,109 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:51,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2021-12-16 09:27:51,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:51,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:51,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:51,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:51,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:51,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:51,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:51,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:51,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:51,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2021-12-16 09:27:51,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:51,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:51,135 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:51,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2021-12-16 09:27:51,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:51,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:51,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:51,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:51,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:51,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:51,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:51,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:51,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:51,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2021-12-16 09:27:51,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:51,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:51,160 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:51,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2021-12-16 09:27:51,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:51,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:51,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:51,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:51,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:51,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:51,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:51,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:51,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2021-12-16 09:27:51,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:51,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:51,191 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:51,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2021-12-16 09:27:51,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:51,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:51,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:51,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:51,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:51,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:51,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:51,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:51,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2021-12-16 09:27:51,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:51,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:51,221 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:51,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2021-12-16 09:27:51,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:51,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:51,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:51,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:51,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:51,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:51,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:51,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:51,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:51,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:51,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:51,251 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:51,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2021-12-16 09:27:51,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:51,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:51,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:51,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:51,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:51,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:51,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:51,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:51,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2021-12-16 09:27:51,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:51,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:51,288 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:51,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2021-12-16 09:27:51,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:51,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:51,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:51,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:51,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:51,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:51,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:51,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:51,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:51,319 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:51,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:51,320 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:51,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2021-12-16 09:27:51,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:51,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:51,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:51,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:51,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:51,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:51,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:51,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:51,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:51,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:51,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:51,350 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:51,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2021-12-16 09:27:51,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:51,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:51,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:51,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:51,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:51,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:51,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:51,364 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:27:51,370 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-16 09:27:51,371 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-16 09:27:51,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:51,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:51,372 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:51,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2021-12-16 09:27:51,373 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:27:51,392 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 09:27:51,393 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:27:51,393 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 24))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 24))_2 Supporting invariants [] [2021-12-16 09:27:51,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2021-12-16 09:27:51,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2021-12-16 09:27:51,618 INFO L297 tatePredicateManager]: 93 out of 95 supporting invariants were superfluous and have been removed [2021-12-16 09:27:51,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:51,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-16 09:27:51,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:51,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:51,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:51,987 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2021-12-16 09:27:51,987 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18 Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:52,020 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 66 transitions. Complement of second has 4 states. [2021-12-16 09:27:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-16 09:27:52,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 45 letters. Loop has 2 letters. [2021-12-16 09:27:52,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:52,021 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:52,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:52,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-16 09:27:52,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:52,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:52,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:52,404 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2021-12-16 09:27:52,404 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18 Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:52,432 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 66 transitions. Complement of second has 4 states. [2021-12-16 09:27:52,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-16 09:27:52,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 45 letters. Loop has 2 letters. [2021-12-16 09:27:52,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:52,433 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:52,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:52,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-16 09:27:52,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:52,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:52,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:52,807 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2021-12-16 09:27:52,808 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18 Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:52,938 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 75 states and 93 transitions. Complement of second has 20 states. [2021-12-16 09:27:52,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-16 09:27:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2021-12-16 09:27:52,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 45 letters. Loop has 2 letters. [2021-12-16 09:27:52,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:52,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 47 letters. Loop has 2 letters. [2021-12-16 09:27:52,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:52,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 45 letters. Loop has 4 letters. [2021-12-16 09:27:52,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:52,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 93 transitions. [2021-12-16 09:27:52,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:52,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 86 transitions. [2021-12-16 09:27:52,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-16 09:27:52,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-16 09:27:52,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 86 transitions. [2021-12-16 09:27:52,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:52,941 INFO L681 BuchiCegarLoop]: Abstraction has 70 states and 86 transitions. [2021-12-16 09:27:52,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 86 transitions. [2021-12-16 09:27:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2021-12-16 09:27:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 59 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2021-12-16 09:27:52,943 INFO L704 BuchiCegarLoop]: Abstraction has 60 states and 70 transitions. [2021-12-16 09:27:52,943 INFO L587 BuchiCegarLoop]: Abstraction has 60 states and 70 transitions. [2021-12-16 09:27:52,943 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-12-16 09:27:52,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 70 transitions. [2021-12-16 09:27:52,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:52,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:52,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:52,944 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:52,944 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:52,945 INFO L791 eck$LassoCheckResult]: Stem: 9438#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9439#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 9440#L561 assume !(main_~array_size~0#1 < 1); 9441#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 9442#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9443#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9444#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9445#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9448#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9462#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9461#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9460#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9459#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9458#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9457#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9456#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9455#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9454#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9453#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 9452#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 9449#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9450#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9491#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9490#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9451#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9435#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9436#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9446#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9447#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9488#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9487#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9486#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9485#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9483#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9482#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9481#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9480#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9478#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9477#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9476#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9475#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9473#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9472#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9471#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9470#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9469#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9466#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9465#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9463#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9433#L552-3 [2021-12-16 09:27:52,945 INFO L793 eck$LassoCheckResult]: Loop: 9433#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9434#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9433#L552-3 [2021-12-16 09:27:52,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:52,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1025367657, now seen corresponding path program 17 times [2021-12-16 09:27:52,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:52,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664891112] [2021-12-16 09:27:52,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:52,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:53,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:27:53,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664891112] [2021-12-16 09:27:53,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664891112] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:27:53,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547222958] [2021-12-16 09:27:53,103 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 09:27:53,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:27:53,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:53,105 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:27:53,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Waiting until timeout for monitored process [2021-12-16 09:27:53,207 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-12-16 09:27:53,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:27:53,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-16 09:27:53,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 91 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:53,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:27:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 91 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:53,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547222958] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:27:53,561 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:27:53,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2021-12-16 09:27:53,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616471556] [2021-12-16 09:27:53,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:27:53,561 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:27:53,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:53,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 17 times [2021-12-16 09:27:53,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:53,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583691511] [2021-12-16 09:27:53,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:53,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:53,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:53,568 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:53,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:27:53,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-16 09:27:53,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2021-12-16 09:27:53,603 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. cyclomatic complexity: 20 Second operand has 29 states, 28 states have (on average 3.107142857142857) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:27:53,830 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2021-12-16 09:27:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-16 09:27:53,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 117 transitions. [2021-12-16 09:27:53,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:53,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 63 states and 73 transitions. [2021-12-16 09:27:53,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-16 09:27:53,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-16 09:27:53,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 73 transitions. [2021-12-16 09:27:53,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:53,832 INFO L681 BuchiCegarLoop]: Abstraction has 63 states and 73 transitions. [2021-12-16 09:27:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 73 transitions. [2021-12-16 09:27:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-12-16 09:27:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2021-12-16 09:27:53,834 INFO L704 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2021-12-16 09:27:53,834 INFO L587 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2021-12-16 09:27:53,834 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-12-16 09:27:53,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 72 transitions. [2021-12-16 09:27:53,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:53,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:53,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:53,834 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:53,834 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:53,835 INFO L791 eck$LassoCheckResult]: Stem: 9936#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9937#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 9938#L561 assume !(main_~array_size~0#1 < 1); 9939#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 9940#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9941#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9942#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9943#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9966#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9965#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9964#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9963#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9962#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9961#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9960#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9959#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9958#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9957#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9956#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 9954#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9953#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 9948#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 9946#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9933#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9934#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9944#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9945#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9947#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9991#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9990#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9989#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9987#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9986#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9985#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9984#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9982#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9981#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9980#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9979#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9977#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9976#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9975#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9974#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9972#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9971#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9970#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9969#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9968#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9952#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9951#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9949#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9931#L552-3 [2021-12-16 09:27:53,835 INFO L793 eck$LassoCheckResult]: Loop: 9931#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9932#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9931#L552-3 [2021-12-16 09:27:53,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1227033589, now seen corresponding path program 18 times [2021-12-16 09:27:53,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:53,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215910690] [2021-12-16 09:27:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:53,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:53,850 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:53,866 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:53,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 18 times [2021-12-16 09:27:53,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:53,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056018978] [2021-12-16 09:27:53,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:53,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:53,870 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:53,872 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:53,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1936726214, now seen corresponding path program 10 times [2021-12-16 09:27:53,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:53,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256717329] [2021-12-16 09:27:53,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:53,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:53,887 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:27:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:27:53,902 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:27:56,175 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:27:56,176 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:27:56,176 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:27:56,176 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:27:56,176 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:27:56,176 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:56,176 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:27:56,176 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:27:56,176 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration21_Lasso [2021-12-16 09:27:56,176 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:27:56,176 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:27:56,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:56,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:27:57,355 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:27:57,355 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:27:57,355 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:57,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:57,356 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:57,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2021-12-16 09:27:57,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:57,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:57,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:57,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:57,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:57,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:57,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:57,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:57,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:57,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2021-12-16 09:27:57,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:57,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:57,381 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:57,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2021-12-16 09:27:57,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:57,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:57,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:57,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:57,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:57,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:57,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:57,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:57,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2021-12-16 09:27:57,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:57,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:57,408 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:57,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2021-12-16 09:27:57,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:57,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:57,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:27:57,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:57,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:57,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:57,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:27:57,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:27:57,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:57,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:57,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:57,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:57,433 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:57,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2021-12-16 09:27:57,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:57,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:57,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:57,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:57,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:57,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:57,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:57,454 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:57,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2021-12-16 09:27:57,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:57,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:57,470 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:57,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2021-12-16 09:27:57,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:57,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:57,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:57,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:57,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:57,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:57,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:57,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:57,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:57,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:57,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:57,506 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:57,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2021-12-16 09:27:57,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:57,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:57,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:57,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:57,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:57,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:57,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:57,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:57,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2021-12-16 09:27:57,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:57,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:57,536 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:57,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2021-12-16 09:27:57,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:57,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:57,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:57,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:57,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:57,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:57,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:57,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:27:57,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2021-12-16 09:27:57,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:57,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:57,565 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:57,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2021-12-16 09:27:57,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:27:57,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:27:57,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:27:57,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:27:57,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:27:57,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:27:57,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:27:57,580 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:27:57,588 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-12-16 09:27:57,588 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-16 09:27:57,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:27:57,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:57,589 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:27:57,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2021-12-16 09:27:57,590 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:27:57,597 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 09:27:57,597 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:27:57,597 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 28))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 28))_1 Supporting invariants [] [2021-12-16 09:27:57,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2021-12-16 09:27:57,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2021-12-16 09:27:57,930 INFO L297 tatePredicateManager]: 122 out of 124 supporting invariants were superfluous and have been removed [2021-12-16 09:27:57,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:57,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-16 09:27:57,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:58,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:58,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:58,333 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2021-12-16 09:27:58,333 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20 Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:58,357 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 74 transitions. Complement of second has 4 states. [2021-12-16 09:27:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-16 09:27:58,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 51 letters. Loop has 2 letters. [2021-12-16 09:27:58,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:58,364 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:58,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-16 09:27:58,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:58,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:58,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:58,766 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2021-12-16 09:27:58,766 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20 Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:58,800 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 74 transitions. Complement of second has 4 states. [2021-12-16 09:27:58,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:27:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-16 09:27:58,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 51 letters. Loop has 2 letters. [2021-12-16 09:27:58,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:58,802 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:27:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:58,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-16 09:27:58,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:59,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:27:59,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:59,218 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2021-12-16 09:27:59,218 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20 Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:59,381 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 83 states and 103 transitions. Complement of second has 22 states. [2021-12-16 09:27:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-16 09:27:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2021-12-16 09:27:59,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 65 transitions. Stem has 51 letters. Loop has 2 letters. [2021-12-16 09:27:59,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:59,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 65 transitions. Stem has 53 letters. Loop has 2 letters. [2021-12-16 09:27:59,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:59,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 65 transitions. Stem has 51 letters. Loop has 4 letters. [2021-12-16 09:27:59,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:27:59,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 103 transitions. [2021-12-16 09:27:59,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:59,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 78 states and 96 transitions. [2021-12-16 09:27:59,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-16 09:27:59,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-16 09:27:59,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 96 transitions. [2021-12-16 09:27:59,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:27:59,392 INFO L681 BuchiCegarLoop]: Abstraction has 78 states and 96 transitions. [2021-12-16 09:27:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 96 transitions. [2021-12-16 09:27:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2021-12-16 09:27:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.164179104477612) internal successors, (78), 66 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:27:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2021-12-16 09:27:59,394 INFO L704 BuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2021-12-16 09:27:59,394 INFO L587 BuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2021-12-16 09:27:59,394 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-12-16 09:27:59,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 78 transitions. [2021-12-16 09:27:59,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:27:59,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:27:59,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:27:59,395 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2021-12-16 09:27:59,395 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:27:59,395 INFO L791 eck$LassoCheckResult]: Stem: 11274#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 11276#L561 assume !(main_~array_size~0#1 < 1); 11277#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 11278#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11279#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11280#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11281#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11284#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11300#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11299#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11298#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11297#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11296#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11295#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11294#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11293#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11292#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11291#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11290#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11289#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 11288#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 11285#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11286#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11334#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11333#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11287#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11271#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11272#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11282#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11283#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11331#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11330#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11329#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11328#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11326#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11325#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11324#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11323#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11321#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11320#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11319#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11318#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11316#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11315#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11314#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11313#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11311#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11310#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11309#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11308#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11307#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11304#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11303#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11301#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11269#L552-3 [2021-12-16 09:27:59,395 INFO L793 eck$LassoCheckResult]: Loop: 11269#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11270#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11269#L552-3 [2021-12-16 09:27:59,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:27:59,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1473052982, now seen corresponding path program 19 times [2021-12-16 09:27:59,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:27:59,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123825948] [2021-12-16 09:27:59,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:27:59,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:27:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:59,563 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 91 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:59,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:27:59,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123825948] [2021-12-16 09:27:59,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123825948] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:27:59,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974572460] [2021-12-16 09:27:59,563 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-16 09:27:59,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:27:59,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:27:59,565 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:27:59,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (184)] Waiting until timeout for monitored process [2021-12-16 09:27:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:27:59,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-16 09:27:59,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:27:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 120 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:27:59,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:28:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 120 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:28:00,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974572460] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:28:00,054 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:28:00,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 31 [2021-12-16 09:28:00,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359274286] [2021-12-16 09:28:00,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:28:00,055 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:28:00,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:00,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 19 times [2021-12-16 09:28:00,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:00,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455851358] [2021-12-16 09:28:00,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:00,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:00,060 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:00,062 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:00,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:28:00,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-16 09:28:00,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2021-12-16 09:28:00,099 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. cyclomatic complexity: 22 Second operand has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:00,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:28:00,317 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2021-12-16 09:28:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-16 09:28:00,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 131 transitions. [2021-12-16 09:28:00,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:28:00,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 70 states and 81 transitions. [2021-12-16 09:28:00,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-16 09:28:00,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-16 09:28:00,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 81 transitions. [2021-12-16 09:28:00,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:28:00,319 INFO L681 BuchiCegarLoop]: Abstraction has 70 states and 81 transitions. [2021-12-16 09:28:00,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 81 transitions. [2021-12-16 09:28:00,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2021-12-16 09:28:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 68 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2021-12-16 09:28:00,320 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2021-12-16 09:28:00,320 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2021-12-16 09:28:00,320 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-12-16 09:28:00,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2021-12-16 09:28:00,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:28:00,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:28:00,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:28:00,321 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2021-12-16 09:28:00,321 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:28:00,322 INFO L791 eck$LassoCheckResult]: Stem: 11832#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11833#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 11834#L561 assume !(main_~array_size~0#1 < 1); 11835#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 11836#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11837#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11838#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11839#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11864#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11863#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11862#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11861#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11860#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11859#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11858#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11857#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11856#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11855#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11854#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11853#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11852#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 11850#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11849#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 11844#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 11842#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11829#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11830#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11840#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11841#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11843#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11894#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11893#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11892#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11890#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11889#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11888#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11887#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11885#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11884#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11883#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11882#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11880#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11879#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11878#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11877#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11875#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11874#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11873#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11872#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11870#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11869#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11868#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11867#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11866#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11848#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11847#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 11845#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11827#L552-3 [2021-12-16 09:28:00,322 INFO L793 eck$LassoCheckResult]: Loop: 11827#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11828#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11827#L552-3 [2021-12-16 09:28:00,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:00,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1562782376, now seen corresponding path program 20 times [2021-12-16 09:28:00,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:00,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414807656] [2021-12-16 09:28:00,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:00,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:00,378 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:00,412 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:00,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:00,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 20 times [2021-12-16 09:28:00,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:00,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292718906] [2021-12-16 09:28:00,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:00,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:00,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:00,419 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:00,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:00,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1404689107, now seen corresponding path program 11 times [2021-12-16 09:28:00,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:00,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838734102] [2021-12-16 09:28:00,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:00,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:00,436 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:00,454 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:04,096 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:28:04,096 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:28:04,097 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:28:04,097 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:28:04,097 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:28:04,097 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:04,097 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:28:04,097 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:28:04,097 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration23_Lasso [2021-12-16 09:28:04,097 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:28:04,097 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:28:04,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:04,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:04,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:04,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:04,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:05,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:05,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:05,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:05,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:05,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:05,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:05,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:05,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:05,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:05,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:05,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:05,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:05,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:28:05,764 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:28:05,765 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:28:05,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:05,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:05,772 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:05,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:05,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:05,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:28:05,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:05,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:05,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:05,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:28:05,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:28:05,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2021-12-16 09:28:05,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:05,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:05,823 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:05,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:05,824 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:05,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:05,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2021-12-16 09:28:05,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:05,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:28:05,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:05,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:05,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:05,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:28:05,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:28:05,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:05,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2021-12-16 09:28:05,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:05,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:05,850 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:05,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2021-12-16 09:28:05,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:05,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:05,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:28:05,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:05,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:05,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:05,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:28:05,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:28:05,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:05,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2021-12-16 09:28:05,874 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:05,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:05,875 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:05,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2021-12-16 09:28:05,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:05,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:05,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:28:05,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:05,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:05,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:05,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:28:05,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:28:05,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:05,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2021-12-16 09:28:05,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:05,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:05,899 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:05,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2021-12-16 09:28:05,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:05,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:05,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:05,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:05,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:05,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:05,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:05,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:05,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2021-12-16 09:28:05,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:05,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:05,930 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:05,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2021-12-16 09:28:05,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:05,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:05,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:05,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:05,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:05,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:05,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:05,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:05,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2021-12-16 09:28:05,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:05,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:05,959 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:05,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2021-12-16 09:28:05,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:05,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:05,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:05,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:05,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:05,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:05,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:05,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:05,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2021-12-16 09:28:05,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:05,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:05,989 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:05,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2021-12-16 09:28:05,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:05,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:05,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:05,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:05,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:06,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:06,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:06,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:06,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2021-12-16 09:28:06,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:06,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:06,026 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:06,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2021-12-16 09:28:06,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:06,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:06,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:06,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:06,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:06,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:06,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:06,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:06,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:06,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:06,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:06,101 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:06,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:06,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:06,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:06,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:06,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:06,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:06,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:06,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2021-12-16 09:28:06,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:28:06,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:06,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:06,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:06,151 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:06,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:28:06,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:28:06,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:28:06,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:28:06,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:28:06,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:28:06,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:28:06,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2021-12-16 09:28:06,191 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:28:06,199 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-16 09:28:06,199 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-16 09:28:06,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:28:06,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:28:06,201 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:28:06,210 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:28:06,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2021-12-16 09:28:06,226 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 09:28:06,226 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:28:06,226 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset (* ULTIMATE.start_main_~i~1#1 4) (- 4)))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset (* ULTIMATE.start_main_~i~1#1 4) (- 4)))_3 Supporting invariants [] [2021-12-16 09:28:06,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:06,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Forceful destruction successful, exit code 0 [2021-12-16 09:28:06,776 INFO L297 tatePredicateManager]: 156 out of 158 supporting invariants were superfluous and have been removed [2021-12-16 09:28:06,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:06,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-16 09:28:06,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:07,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:28:07,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:28:07,489 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.20 stem predicates 2 loop predicates [2021-12-16 09:28:07,489 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22 Second operand has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:07,643 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22. Second operand has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 75 states and 88 transitions. Complement of second has 14 states. [2021-12-16 09:28:07,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 12 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:28:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2021-12-16 09:28:07,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 32 transitions. Stem has 57 letters. Loop has 2 letters. [2021-12-16 09:28:07,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:28:07,644 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:28:07,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:07,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-16 09:28:07,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:08,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:28:08,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:28:08,380 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.20 stem predicates 2 loop predicates [2021-12-16 09:28:08,381 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22 Second operand has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:08,523 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22. Second operand has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 75 states and 88 transitions. Complement of second has 14 states. [2021-12-16 09:28:08,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 12 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-16 09:28:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2021-12-16 09:28:08,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 32 transitions. Stem has 57 letters. Loop has 2 letters. [2021-12-16 09:28:08,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:28:08,524 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:28:08,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:08,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-16 09:28:08,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:28:09,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:28:09,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:28:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:28:09,247 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.20 stem predicates 2 loop predicates [2021-12-16 09:28:09,247 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22 Second operand has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:09,652 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22. Second operand has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 151 states and 192 transitions. Complement of second has 35 states. [2021-12-16 09:28:09,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 20 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-16 09:28:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 99 transitions. [2021-12-16 09:28:09,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 99 transitions. Stem has 57 letters. Loop has 2 letters. [2021-12-16 09:28:09,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:28:09,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 99 transitions. Stem has 59 letters. Loop has 2 letters. [2021-12-16 09:28:09,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:28:09,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 99 transitions. Stem has 57 letters. Loop has 4 letters. [2021-12-16 09:28:09,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:28:09,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 192 transitions. [2021-12-16 09:28:09,655 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-16 09:28:09,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 146 states and 185 transitions. [2021-12-16 09:28:09,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-16 09:28:09,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-16 09:28:09,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 185 transitions. [2021-12-16 09:28:09,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:28:09,656 INFO L681 BuchiCegarLoop]: Abstraction has 146 states and 185 transitions. [2021-12-16 09:28:09,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 185 transitions. [2021-12-16 09:28:09,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 78. [2021-12-16 09:28:09,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.1666666666666667) internal successors, (91), 77 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:28:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2021-12-16 09:28:09,658 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2021-12-16 09:28:09,658 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2021-12-16 09:28:09,658 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-12-16 09:28:09,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 91 transitions. [2021-12-16 09:28:09,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:28:09,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:28:09,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:28:09,659 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2021-12-16 09:28:09,659 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:28:09,660 INFO L791 eck$LassoCheckResult]: Stem: 13551#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13552#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 13553#L561 assume !(main_~array_size~0#1 < 1); 13554#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 13555#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 13556#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13557#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 13558#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13564#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 13584#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13583#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 13582#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13581#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 13580#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13579#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 13578#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13577#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 13576#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13575#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 13574#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13572#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 13573#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13628#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 13571#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13570#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 13569#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 13567#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13561#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13562#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13565#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 13566#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13620#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13619#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13618#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 13617#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13615#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13614#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13613#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 13612#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13610#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13609#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13608#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 13607#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13605#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13604#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13603#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 13602#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13600#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13599#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13598#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 13597#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13595#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13594#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13593#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 13592#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13591#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13588#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13587#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 13585#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13559#L552-3 [2021-12-16 09:28:09,660 INFO L793 eck$LassoCheckResult]: Loop: 13559#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13560#L552-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13559#L552-3 [2021-12-16 09:28:09,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:09,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1577199866, now seen corresponding path program 21 times [2021-12-16 09:28:09,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:09,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564705240] [2021-12-16 09:28:09,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:09,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:09,678 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:09,694 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:09,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:09,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 21 times [2021-12-16 09:28:09,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:09,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691897798] [2021-12-16 09:28:09,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:09,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:09,698 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:09,701 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:28:09,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:28:09,701 INFO L85 PathProgramCache]: Analyzing trace with hash 434385419, now seen corresponding path program 12 times [2021-12-16 09:28:09,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:28:09,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069340858] [2021-12-16 09:28:09,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:28:09,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:28:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:09,719 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:28:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:28:09,737 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace