./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 3a877d22 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-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:02:03,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:02:03,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:02:03,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:02:03,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:02:03,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:02:03,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:02:03,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:02:03,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:02:03,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:02:03,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:02:03,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:02:03,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:02:03,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:02:03,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:02:03,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:02:03,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:02:03,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:02:03,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:02:03,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:02:03,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:02:03,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:02:03,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:02:03,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:02:03,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:02:03,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:02:03,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:02:03,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:02:03,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:02:03,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:02:03,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:02:03,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:02:03,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:02:03,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:02:03,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:02:03,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:02:03,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:02:03,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:02:03,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:02:03,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:02:03,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:02:03,684 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-15 17:02:03,713 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:02:03,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:02:03,714 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:02:03,714 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:02:03,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:02:03,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:02:03,716 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:02:03,716 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:02:03,716 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:02:03,716 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:02:03,717 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:02:03,717 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:02:03,717 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:02:03,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:02:03,718 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:02:03,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:02:03,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:02:03,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:02:03,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:02:03,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:02:03,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:02:03,719 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:02:03,719 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:02:03,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:02:03,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:02:03,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:02:03,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:02:03,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:02:03,720 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:02:03,721 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:02:03,721 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-15 17:02:03,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:02:03,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:02:03,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:02:03,963 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:02:03,963 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:02:03,964 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-15 17:02:04,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0ae157b/c810d2b778e643fe97e148eb4c86da11/FLAGc7389ae79 [2021-12-15 17:02:04,368 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:02:04,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i [2021-12-15 17:02:04,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0ae157b/c810d2b778e643fe97e148eb4c86da11/FLAGc7389ae79 [2021-12-15 17:02:04,771 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0ae157b/c810d2b778e643fe97e148eb4c86da11 [2021-12-15 17:02:04,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:02:04,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:02:04,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:02:04,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:02:04,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:02:04,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:02:04" (1/1) ... [2021-12-15 17:02:04,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a2e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:02:04, skipping insertion in model container [2021-12-15 17:02:04,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:02:04" (1/1) ... [2021-12-15 17:02:04,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:02:04,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:02:05,004 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:02:05,009 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:02:05,045 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:02:05,072 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:02:05,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:02:05 WrapperNode [2021-12-15 17:02:05,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:02:05,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:02:05,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:02:05,074 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:02:05,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:02:05" (1/1) ... [2021-12-15 17:02:05,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:02:05" (1/1) ... [2021-12-15 17:02:05,098 INFO L137 Inliner]: procedures = 111, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2021-12-15 17:02:05,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:02:05,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:02:05,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:02:05,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:02:05,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:02:05" (1/1) ... [2021-12-15 17:02:05,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:02:05" (1/1) ... [2021-12-15 17:02:05,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:02:05" (1/1) ... [2021-12-15 17:02:05,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:02:05" (1/1) ... [2021-12-15 17:02:05,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:02:05" (1/1) ... [2021-12-15 17:02:05,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:02:05" (1/1) ... [2021-12-15 17:02:05,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:02:05" (1/1) ... [2021-12-15 17:02:05,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:02:05,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:02:05,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:02:05,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:02:05,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:02:05" (1/1) ... [2021-12-15 17:02:05,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:05,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:05,171 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-15 17:02:05,173 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-15 17:02:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:02:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:02:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:02:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:02:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:02:05,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:02:05,298 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:02:05,299 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:02:05,430 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:02:05,434 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:02:05,434 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 17:02:05,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:02:05 BoogieIcfgContainer [2021-12-15 17:02:05,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:02:05,436 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:02:05,436 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:02:05,442 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:02:05,442 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:02:05,442 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:02:04" (1/3) ... [2021-12-15 17:02:05,444 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13146820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:02:05, skipping insertion in model container [2021-12-15 17:02:05,444 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:02:05,444 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:02:05" (2/3) ... [2021-12-15 17:02:05,444 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13146820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:02:05, skipping insertion in model container [2021-12-15 17:02:05,445 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:02:05,445 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:02:05" (3/3) ... [2021-12-15 17:02:05,446 INFO L388 chiAutomizerObserver]: Analyzing ICFG array01-alloca-1.i [2021-12-15 17:02:05,487 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:02:05,488 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:02:05,488 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:02:05,488 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:02:05,488 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:02:05,488 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:02:05,488 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:02:05,489 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:02:05,499 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-15 17:02:05,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:02:05,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:05,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:05,521 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-15 17:02:05,522 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:05,522 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:02:05,522 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-15 17:02:05,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:02:05,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:05,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:05,526 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-15 17:02:05,526 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:05,531 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-15 17:02:05,531 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-15 17:02:05,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-12-15 17:02:05,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:05,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837010992] [2021-12-15 17:02:05,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:05,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:05,621 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:05,649 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:05,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:05,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-12-15 17:02:05,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:05,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722362102] [2021-12-15 17:02:05,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:05,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:05,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:05,687 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:05,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:05,689 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-12-15 17:02:05,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:05,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497834550] [2021-12-15 17:02:05,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:05,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:05,709 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:05,737 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:05,988 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:02:05,989 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:02:05,989 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:02:05,989 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:02:05,989 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:02:05,989 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:05,989 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:02:05,990 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:02:05,990 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration1_Lasso [2021-12-15 17:02:05,990 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:02:05,991 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:02:06,009 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-15 17:02:06,012 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-15 17:02:06,108 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-15 17:02:06,110 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-15 17:02:06,113 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-15 17:02:06,116 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-15 17:02:06,131 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-15 17:02:06,133 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-15 17:02:06,136 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-15 17:02:06,138 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-15 17:02:06,293 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:02:06,296 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:02:06,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:06,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:06,298 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-15 17:02:06,304 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-15 17:02:06,313 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-15 17:02:06,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:06,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:06,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:06,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:06,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:06,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:06,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:06,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:06,344 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-15 17:02:06,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:06,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:06,346 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-15 17:02:06,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-15 17:02:06,354 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-15 17:02:06,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:06,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:06,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:06,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:06,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:06,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:06,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:06,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:06,394 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:06,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:06,444 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-15 17:02:06,445 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-15 17:02:06,446 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-15 17:02:06,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:06,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:06,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:06,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:06,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:06,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:06,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:06,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:06,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-12-15 17:02:06,474 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:06,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:06,475 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-15 17:02:06,475 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-15 17:02:06,476 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-15 17:02:06,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:06,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:06,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:06,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:06,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:06,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:06,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:06,517 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-15 17:02:06,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:06,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:06,518 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-15 17:02:06,518 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-15 17:02:06,520 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-15 17:02:06,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:06,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:06,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:06,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:06,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:06,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:06,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:06,573 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-15 17:02:06,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:06,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:06,574 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-15 17:02:06,575 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-15 17:02:06,577 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-15 17:02:06,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:06,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:06,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:06,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:06,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:06,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:06,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:06,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:06,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:06,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:06,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:06,612 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-15 17:02:06,613 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-15 17:02:06,614 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-15 17:02:06,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:06,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:06,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:06,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:06,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:06,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:06,639 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:02:06,657 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-15 17:02:06,658 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-12-15 17:02:06,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:06,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:06,680 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-15 17:02:06,713 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:02:06,722 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-15 17:02:06,745 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-15 17:02:06,746 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:02:06,746 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1, ULTIMATE.start_main_~i~1#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1 - 4*ULTIMATE.start_main_~i~1#1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0#1.offset >= 0] [2021-12-15 17:02:06,769 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-15 17:02:06,776 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2021-12-15 17:02:06,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:06,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 17:02:06,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:06,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 17:02:06,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:06,881 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-15 17:02:06,903 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-15 17:02:06,904 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-15 17:02:06,948 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 35 states and 50 transitions. Complement of second has 8 states. [2021-12-15 17:02:06,950 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-15 17:02:06,953 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-15 17:02:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2021-12-15 17:02:06,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-15 17:02:06,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:06,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-15 17:02:06,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:06,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 4 letters. Loop has 4 letters. [2021-12-15 17:02:06,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:06,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2021-12-15 17:02:06,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:02:06,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 16 transitions. [2021-12-15 17:02:06,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:02:06,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:02:06,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2021-12-15 17:02:06,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:02:06,961 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-15 17:02:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2021-12-15 17:02:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-15 17:02:06,976 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-15 17:02:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2021-12-15 17:02:06,977 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-15 17:02:06,977 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-15 17:02:06,977 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:02:06,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2021-12-15 17:02:06,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:02:06,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:06,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:06,978 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:02:06,978 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:02:06,978 INFO L791 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 121#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; 122#L561 assume !(main_~array_size~0#1 < 1); 123#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; 124#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 126#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; 129#L551-3 [2021-12-15 17:02:06,979 INFO L793 eck$LassoCheckResult]: Loop: 129#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 118#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); 119#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 128#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; 129#L551-3 [2021-12-15 17:02:06,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:06,979 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-12-15 17:02:06,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:06,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644483222] [2021-12-15 17:02:06,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:06,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:07,013 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-15 17:02:07,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:02:07,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644483222] [2021-12-15 17:02:07,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644483222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:02:07,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:02:07,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:02:07,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619124535] [2021-12-15 17:02:07,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:02:07,017 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:02:07,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:07,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 1 times [2021-12-15 17:02:07,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:07,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539321233] [2021-12-15 17:02:07,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:07,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:07,022 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:07,059 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-15 17:02:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:07,061 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:07,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:02:07,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:02:07,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:02:07,107 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-15 17:02:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:02:07,123 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2021-12-15 17:02:07,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:02:07,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2021-12-15 17:02:07,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:02:07,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2021-12-15 17:02:07,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:02:07,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:02:07,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2021-12-15 17:02:07,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:02:07,128 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2021-12-15 17:02:07,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2021-12-15 17:02:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2021-12-15 17:02:07,130 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-15 17:02:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2021-12-15 17:02:07,130 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2021-12-15 17:02:07,130 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2021-12-15 17:02:07,130 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:02:07,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2021-12-15 17:02:07,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:02:07,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:07,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:07,131 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:07,131 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:02:07,132 INFO L791 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#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; 152#L561 assume !(main_~array_size~0#1 < 1); 153#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; 154#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; 155#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 156#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 157#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; 161#L551-3 [2021-12-15 17:02:07,132 INFO L793 eck$LassoCheckResult]: Loop: 161#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 158#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); 159#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 160#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; 161#L551-3 [2021-12-15 17:02:07,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:07,132 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-12-15 17:02:07,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:07,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436207546] [2021-12-15 17:02:07,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:07,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:07,145 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:07,153 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:07,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:07,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 2 times [2021-12-15 17:02:07,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:07,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593224636] [2021-12-15 17:02:07,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:07,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:07,157 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:07,160 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:07,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:07,160 INFO L85 PathProgramCache]: Analyzing trace with hash -357810950, now seen corresponding path program 1 times [2021-12-15 17:02:07,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:07,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571812296] [2021-12-15 17:02:07,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:07,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:07,169 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:07,179 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:07,462 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:02:07,463 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:02:07,463 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:02:07,463 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:02:07,463 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:02:07,463 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:07,463 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:02:07,463 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:02:07,463 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration3_Lasso [2021-12-15 17:02:07,464 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:02:07,464 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:02:07,468 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-15 17:02:07,470 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-15 17:02:07,473 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-15 17:02:07,475 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-15 17:02:07,478 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-15 17:02:07,480 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-15 17:02:07,619 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-15 17:02:07,622 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-15 17:02:07,623 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-15 17:02:07,626 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-15 17:02:07,627 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-15 17:02:07,670 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-15 17:02:07,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-15 17:02:07,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-15 17:02:07,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-15 17:02:07,678 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-15 17:02:07,681 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-15 17:02:07,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-15 17:02:07,686 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-15 17:02:07,909 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:02:07,909 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:02:07,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:07,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:07,915 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-15 17:02:07,922 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-15 17:02:07,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:07,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:07,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:07,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:07,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:07,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:07,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:07,939 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-15 17:02:07,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:07,956 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-15 17:02:07,957 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:07,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:07,958 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-15 17:02:07,963 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-15 17:02:07,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:07,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:07,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:07,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:07,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:07,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:07,983 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-15 17:02:07,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:07,999 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-15 17:02:08,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:08,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:08,000 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-15 17:02:08,001 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-15 17:02:08,003 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-15 17:02:08,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:08,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:08,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:08,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:08,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:08,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:08,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:08,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-12-15 17:02:08,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:08,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:08,039 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-15 17:02:08,040 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-15 17:02:08,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-15 17:02:08,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:08,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:08,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:08,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:08,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:08,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:08,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:08,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:08,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-15 17:02:08,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:08,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:08,079 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-15 17:02:08,080 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-15 17:02:08,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-15 17:02:08,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:08,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:08,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:08,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:08,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:08,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:08,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:08,122 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-15 17:02:08,123 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:08,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:08,123 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-15 17:02:08,124 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-15 17:02:08,141 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-15 17:02:08,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:08,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:08,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:08,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:08,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:08,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:08,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:08,177 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-15 17:02:08,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:08,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:08,178 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-15 17:02:08,179 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-15 17:02:08,180 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-15 17:02:08,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:08,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:08,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:08,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:08,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:08,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:08,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:08,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-12-15 17:02:08,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:08,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:08,220 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-15 17:02:08,221 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-15 17:02:08,222 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-15 17:02:08,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:08,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:08,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:08,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:08,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:08,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:08,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:08,271 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-15 17:02:08,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:08,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:08,272 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-15 17:02:08,273 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-15 17:02:08,275 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-15 17:02:08,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:08,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:08,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:08,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:08,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:08,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:08,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:08,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-12-15 17:02:08,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:08,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:08,314 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-15 17:02:08,314 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-15 17:02:08,317 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-15 17:02:08,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:08,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:08,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:08,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:08,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:08,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:08,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:02:08,374 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-15 17:02:08,374 INFO L444 ModelExtractionUtils]: 12 out of 37 variables were initially zero. Simplification set additionally 21 variables to zero. [2021-12-15 17:02:08,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:08,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:08,375 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-15 17:02:08,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:02:08,435 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-15 17:02:08,443 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-15 17:02:08,443 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:02:08,444 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~i~0#1, v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_2) = -4*ULTIMATE.start_test_fun_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_2 Supporting invariants [1*ULTIMATE.start_test_fun_~a#1.offset >= 0] [2021-12-15 17:02:08,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-12-15 17:02:08,475 INFO L297 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2021-12-15 17:02:08,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:08,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 17:02:08,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:08,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 17:02:08,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:08,582 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-15 17:02:08,583 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-15 17:02:08,583 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-15 17:02:08,618 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-15 17:02:08,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-15 17:02:08,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-15 17:02:08,634 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-15 17:02:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2021-12-15 17:02:08,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2021-12-15 17:02:08,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:08,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 12 letters. Loop has 4 letters. [2021-12-15 17:02:08,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:08,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 8 letters. [2021-12-15 17:02:08,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:08,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2021-12-15 17:02:08,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:08,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 22 transitions. [2021-12-15 17:02:08,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:02:08,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:02:08,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2021-12-15 17:02:08,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:08,636 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2021-12-15 17:02:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2021-12-15 17:02:08,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2021-12-15 17:02:08,637 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-15 17:02:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2021-12-15 17:02:08,637 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-15 17:02:08,637 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-15 17:02:08,637 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:02:08,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2021-12-15 17:02:08,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:08,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:08,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:08,640 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:08,640 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:08,640 INFO L791 eck$LassoCheckResult]: Stem: 275#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 276#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; 277#L561 assume !(main_~array_size~0#1 < 1); 278#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; 279#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; 280#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 281#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 282#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; 285#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 271#L552-3 [2021-12-15 17:02:08,640 INFO L793 eck$LassoCheckResult]: Loop: 271#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); 272#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; 271#L552-3 [2021-12-15 17:02:08,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:08,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2021-12-15 17:02:08,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:08,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217711071] [2021-12-15 17:02:08,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:08,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:08,654 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:08,667 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:08,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:08,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2021-12-15 17:02:08,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:08,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312188007] [2021-12-15 17:02:08,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:08,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:08,674 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:08,677 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:08,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:08,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2021-12-15 17:02:08,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:08,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656282748] [2021-12-15 17:02:08,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:08,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:08,686 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:08,695 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:08,934 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:02:08,934 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:02:08,934 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:02:08,934 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:02:08,934 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:02:08,934 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:08,934 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:02:08,934 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:02:08,935 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration4_Lasso [2021-12-15 17:02:08,935 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:02:08,935 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:02:08,936 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-15 17:02:08,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-15 17:02:08,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-15 17:02:08,942 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-15 17:02:08,944 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-15 17:02:08,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-15 17:02:08,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-15 17:02:08,948 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-15 17:02:08,949 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-15 17:02:09,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-15 17:02:09,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-15 17:02:09,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-15 17:02:09,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-15 17:02:09,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-15 17:02:09,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-15 17:02:09,086 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-15 17:02:09,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-15 17:02:09,089 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-15 17:02:09,345 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:02:09,346 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:02:09,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:09,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:09,347 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-15 17:02:09,351 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-15 17:02:09,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:09,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:09,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:09,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:09,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:09,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:09,362 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-15 17:02:09,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:09,384 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-15 17:02:09,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:09,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:09,385 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-15 17:02:09,386 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-15 17:02:09,388 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-15 17:02:09,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:09,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:09,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:09,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:09,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:09,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:09,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:09,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:09,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-15 17:02:09,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:09,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:09,427 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-15 17:02:09,428 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-15 17:02:09,429 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-15 17:02:09,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:09,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:09,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:09,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:09,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:09,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:09,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:09,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:09,451 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-15 17:02:09,452 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:09,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:09,453 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-15 17:02:09,453 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-15 17:02:09,455 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-15 17:02:09,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:09,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:09,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:09,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:09,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:09,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:09,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:09,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:09,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:09,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:09,489 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-15 17:02:09,490 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-15 17:02:09,491 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-15 17:02:09,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:09,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:09,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:09,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:09,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:09,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:09,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:09,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:09,513 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-15 17:02:09,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:09,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:09,515 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-15 17:02:09,515 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-15 17:02:09,517 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-15 17:02:09,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:09,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:09,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:09,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:09,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:09,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:09,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:09,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:09,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:09,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:09,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:09,547 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-15 17:02:09,548 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-15 17:02:09,549 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-15 17:02:09,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:09,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:09,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:09,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:09,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:09,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:09,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:09,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:09,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:09,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:09,574 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-15 17:02:09,576 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-15 17:02:09,577 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-15 17:02:09,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:09,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:09,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:09,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:09,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:09,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:09,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:09,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:09,598 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-15 17:02:09,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:09,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:09,601 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-15 17:02:09,602 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-15 17:02:09,603 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-15 17:02:09,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:09,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:09,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:09,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:09,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:09,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:09,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:09,660 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-15 17:02:09,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:09,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:09,661 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-15 17:02:09,661 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-15 17:02:09,663 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-15 17:02:09,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:09,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:09,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:09,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:09,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:09,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:09,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:09,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:09,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:09,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:09,705 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-15 17:02:09,706 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-15 17:02:09,707 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-15 17:02:09,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:09,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:09,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:09,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:09,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:09,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:09,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:09,733 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-15 17:02:09,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:09,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:09,734 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-15 17:02:09,735 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-15 17:02:09,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-15 17:02:09,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:09,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:09,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:09,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:09,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:09,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:09,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:09,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:09,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:09,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:09,763 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-15 17:02:09,763 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-15 17:02:09,765 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-15 17:02:09,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:09,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:09,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:09,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:09,773 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:09,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:09,777 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:02:09,782 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-15 17:02:09,782 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-15 17:02:09,782 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:09,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:09,783 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-15 17:02:09,784 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-15 17:02:09,787 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:02:09,793 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:02:09,793 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:02:09,793 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-15 17:02:09,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:09,836 INFO L297 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2021-12-15 17:02:09,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:09,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 17:02:09,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:09,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:09,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:09,918 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-15 17:02:09,918 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-15 17:02:09,919 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-15 17:02:09,959 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-15 17:02:09,959 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-15 17:02:09,960 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-15 17:02:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2021-12-15 17:02:09,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2021-12-15 17:02:09,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:09,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2021-12-15 17:02:09,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:09,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2021-12-15 17:02:09,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:09,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2021-12-15 17:02:09,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:09,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 24 transitions. [2021-12-15 17:02:09,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:02:09,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-15 17:02:09,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2021-12-15 17:02:09,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:09,962 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-12-15 17:02:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2021-12-15 17:02:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-12-15 17:02:09,962 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-15 17:02:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2021-12-15 17:02:09,963 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2021-12-15 17:02:09,963 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2021-12-15 17:02:09,963 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:02:09,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2021-12-15 17:02:09,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:09,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:09,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:09,964 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:09,964 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:09,964 INFO L791 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 400#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; 405#L561 assume !(main_~array_size~0#1 < 1); 406#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; 407#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; 408#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 409#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 410#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; 413#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 414#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); 415#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 411#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; 412#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 401#L552-3 [2021-12-15 17:02:09,964 INFO L793 eck$LassoCheckResult]: Loop: 401#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); 402#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; 401#L552-3 [2021-12-15 17:02:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1792762469, now seen corresponding path program 2 times [2021-12-15 17:02:09,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:09,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477519353] [2021-12-15 17:02:09,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:09,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:10,013 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-15 17:02:10,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:02:10,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477519353] [2021-12-15 17:02:10,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477519353] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:02:10,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930807348] [2021-12-15 17:02:10,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:02:10,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:02:10,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:10,016 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-15 17:02:10,018 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-15 17:02:10,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:02:10,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:02:10,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:02:10,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:10,102 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-15 17:02:10,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:02:10,156 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-15 17:02:10,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930807348] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:02:10,156 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:02:10,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2021-12-15 17:02:10,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130226159] [2021-12-15 17:02:10,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:02:10,157 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:02:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:10,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2021-12-15 17:02:10,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:10,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668856966] [2021-12-15 17:02:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:10,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:10,169 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:10,179 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:10,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:02:10,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 17:02:10,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-15 17:02:10,208 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-15 17:02:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:02:10,270 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2021-12-15 17:02:10,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 17:02:10,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2021-12-15 17:02:10,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:10,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2021-12-15 17:02:10,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:02:10,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-15 17:02:10,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2021-12-15 17:02:10,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:10,278 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-15 17:02:10,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2021-12-15 17:02:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-12-15 17:02:10,279 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-15 17:02:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-12-15 17:02:10,279 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-12-15 17:02:10,279 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-12-15 17:02:10,280 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:02:10,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2021-12-15 17:02:10,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:10,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:10,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:10,280 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:10,280 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:10,281 INFO L791 eck$LassoCheckResult]: Stem: 554#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 555#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; 556#L561 assume !(main_~array_size~0#1 < 1); 557#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; 546#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; 547#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 548#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; 549#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 565#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 563#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; 560#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 561#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); 564#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 558#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; 559#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 550#L552-3 [2021-12-15 17:02:10,281 INFO L793 eck$LassoCheckResult]: Loop: 550#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); 551#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; 550#L552-3 [2021-12-15 17:02:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1166615491, now seen corresponding path program 3 times [2021-12-15 17:02:10,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:10,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229952597] [2021-12-15 17:02:10,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:10,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:10,306 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:10,314 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:10,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:10,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2021-12-15 17:02:10,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:10,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076707156] [2021-12-15 17:02:10,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:10,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:10,325 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:10,328 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:10,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:10,328 INFO L85 PathProgramCache]: Analyzing trace with hash 131023752, now seen corresponding path program 1 times [2021-12-15 17:02:10,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:10,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404621952] [2021-12-15 17:02:10,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:10,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:10,336 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:10,373 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:10,377 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-15 17:02:10,678 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:02:10,678 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:02:10,678 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:02:10,678 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:02:10,678 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:02:10,678 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:10,678 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:02:10,678 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:02:10,678 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration6_Lasso [2021-12-15 17:02:10,678 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:02:10,678 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:02:10,680 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-15 17:02:10,690 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-15 17:02:10,691 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-15 17:02:10,693 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-15 17:02:10,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-15 17:02:10,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-15 17:02:10,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-15 17:02:10,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-15 17:02:10,701 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-15 17:02:10,702 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-15 17:02:10,703 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-15 17:02:10,705 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-15 17:02:10,706 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-15 17:02:10,708 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-15 17:02:10,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-15 17:02:10,710 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-15 17:02:10,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-15 17:02:10,862 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-15 17:02:10,873 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-15 17:02:11,133 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:02:11,133 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:02:11,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,134 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-15 17:02:11,135 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-15 17:02:11,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-15 17:02:11,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:11,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:11,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-12-15 17:02:11,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,175 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-15 17:02:11,175 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-15 17:02:11,177 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-15 17:02:11,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:11,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:11,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,211 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-15 17:02:11,211 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,212 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-15 17:02:11,212 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-15 17:02:11,214 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-15 17:02:11,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:11,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:11,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:11,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-12-15 17:02:11,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,237 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-15 17:02:11,237 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-15 17:02:11,239 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-15 17:02:11,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:11,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:11,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,296 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-15 17:02:11,296 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,297 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-15 17:02:11,301 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-15 17:02:11,301 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-15 17:02:11,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:11,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:11,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:11,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:11,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,324 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-15 17:02:11,325 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-15 17:02:11,326 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-15 17:02:11,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:11,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:11,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-12-15 17:02:11,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,351 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-15 17:02:11,351 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-15 17:02:11,354 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-15 17:02:11,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:11,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:11,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:11,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-12-15 17:02:11,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,377 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-15 17:02:11,378 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-15 17:02:11,379 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-15 17:02:11,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:11,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:11,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,416 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-15 17:02:11,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,417 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-15 17:02:11,418 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-15 17:02:11,419 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-15 17:02:11,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:11,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:11,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:11,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,441 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-15 17:02:11,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,442 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-15 17:02:11,443 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-15 17:02:11,445 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-15 17:02:11,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:11,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:11,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:11,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-12-15 17:02:11,474 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,475 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-15 17:02:11,476 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-15 17:02:11,479 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-15 17:02:11,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:11,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:11,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:11,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:11,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,501 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-15 17:02:11,502 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-15 17:02:11,503 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-15 17:02:11,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:11,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:11,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:11,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:11,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,525 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-15 17:02:11,525 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-15 17:02:11,527 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-15 17:02:11,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:11,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:11,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,549 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-15 17:02:11,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,550 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-15 17:02:11,551 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-15 17:02:11,552 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-15 17:02:11,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:11,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:11,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:11,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-12-15 17:02:11,586 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,586 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-15 17:02:11,587 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-15 17:02:11,588 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-15 17:02:11,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:11,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:11,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:11,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:11,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,611 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-15 17:02:11,611 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-15 17:02:11,613 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-15 17:02:11,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:11,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:11,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:11,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-15 17:02:11,635 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,636 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-15 17:02:11,637 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-15 17:02:11,638 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-15 17:02:11,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:11,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:11,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-12-15 17:02:11,678 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,679 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-15 17:02:11,679 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-15 17:02:11,681 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-15 17:02:11,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:11,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:11,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:11,706 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-15 17:02:11,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,707 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-15 17:02:11,707 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-15 17:02:11,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-15 17:02:11,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:11,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:11,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:11,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:11,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:11,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:11,729 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:02:11,751 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-15 17:02:11,751 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-15 17:02:11,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:11,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:11,752 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-15 17:02:11,753 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-15 17:02:11,759 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:02:11,765 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:02:11,765 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:02:11,765 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-15 17:02:11,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-12-15 17:02:11,796 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2021-12-15 17:02:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:11,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-15 17:02:11,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:11,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:11,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:11,937 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-15 17:02:11,937 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-15 17:02:11,937 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-15 17:02:11,955 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-15 17:02:11,955 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-15 17:02:11,956 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-15 17:02:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:02:11,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 2 letters. [2021-12-15 17:02:11,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:11,956 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:11,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:11,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-15 17:02:11,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:12,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:12,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:12,092 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-15 17:02:12,093 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-15 17:02:12,093 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-15 17:02:12,112 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-15 17:02:12,113 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-15 17:02:12,113 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-15 17:02:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:02:12,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 2 letters. [2021-12-15 17:02:12,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:12,114 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:12,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-15 17:02:12,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:12,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:12,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:12,267 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-15 17:02:12,268 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-15 17:02:12,268 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-15 17:02:12,318 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-15 17:02:12,319 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-15 17:02:12,319 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-15 17:02:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2021-12-15 17:02:12,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 2 letters. [2021-12-15 17:02:12,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:12,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 17 letters. Loop has 2 letters. [2021-12-15 17:02:12,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:12,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 4 letters. [2021-12-15 17:02:12,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:12,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2021-12-15 17:02:12,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:12,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 36 transitions. [2021-12-15 17:02:12,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:02:12,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-15 17:02:12,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2021-12-15 17:02:12,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:12,321 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-12-15 17:02:12,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2021-12-15 17:02:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2021-12-15 17:02:12,322 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-15 17:02:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2021-12-15 17:02:12,322 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-12-15 17:02:12,322 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-12-15 17:02:12,322 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:02:12,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2021-12-15 17:02:12,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:12,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:12,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:12,323 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:12,323 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:12,323 INFO L791 eck$LassoCheckResult]: Stem: 902#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 903#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; 904#L561 assume !(main_~array_size~0#1 < 1); 905#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; 906#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; 907#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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); 918#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; 913#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 914#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); 920#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 919#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; 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; 911#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; 912#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 898#L552-3 [2021-12-15 17:02:12,323 INFO L793 eck$LassoCheckResult]: Loop: 898#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); 899#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; 898#L552-3 [2021-12-15 17:02:12,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:12,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1359773592, now seen corresponding path program 4 times [2021-12-15 17:02:12,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:12,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284613951] [2021-12-15 17:02:12,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:12,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:12,371 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-15 17:02:12,390 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-15 17:02:12,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:02:12,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284613951] [2021-12-15 17:02:12,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284613951] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:02:12,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228899499] [2021-12-15 17:02:12,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 17:02:12,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:02:12,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:12,391 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-15 17:02:12,392 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-15 17:02:12,427 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 17:02:12,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:02:12,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 17:02:12,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:12,511 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-15 17:02:12,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:02:12,554 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-15 17:02:12,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228899499] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:02:12,555 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:02:12,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2021-12-15 17:02:12,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053525427] [2021-12-15 17:02:12,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:02:12,555 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:02:12,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:12,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 4 times [2021-12-15 17:02:12,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:12,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026138207] [2021-12-15 17:02:12,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:12,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:12,560 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:12,562 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:12,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:02:12,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 17:02:12,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-12-15 17:02:12,593 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-15 17:02:12,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:02:12,662 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2021-12-15 17:02:12,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 17:02:12,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2021-12-15 17:02:12,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:12,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 28 states and 33 transitions. [2021-12-15 17:02:12,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:02:12,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-15 17:02:12,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2021-12-15 17:02:12,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:12,663 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-15 17:02:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2021-12-15 17:02:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-15 17:02:12,664 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-15 17:02:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2021-12-15 17:02:12,664 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-12-15 17:02:12,664 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-12-15 17:02:12,664 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:02:12,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2021-12-15 17:02:12,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:12,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:12,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:12,665 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:12,665 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:12,665 INFO L791 eck$LassoCheckResult]: Stem: 1100#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1101#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; 1102#L561 assume !(main_~array_size~0#1 < 1); 1103#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; 1104#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; 1105#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 1122#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; 1121#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1120#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1114#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; 1110#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1111#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); 1118#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1108#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; 1109#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1112#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); 1117#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1116#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; 1115#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1096#L552-3 [2021-12-15 17:02:12,665 INFO L793 eck$LassoCheckResult]: Loop: 1096#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); 1097#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; 1096#L552-3 [2021-12-15 17:02:12,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:12,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1255193994, now seen corresponding path program 5 times [2021-12-15 17:02:12,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:12,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015248429] [2021-12-15 17:02:12,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:12,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:12,682 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:12,691 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:12,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:12,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 5 times [2021-12-15 17:02:12,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:12,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885782313] [2021-12-15 17:02:12,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:12,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:12,694 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:12,696 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:12,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash 644383099, now seen corresponding path program 2 times [2021-12-15 17:02:12,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:12,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176197183] [2021-12-15 17:02:12,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:12,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:12,705 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:12,715 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:13,161 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:02:13,162 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:02:13,162 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:02:13,162 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:02:13,162 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:02:13,162 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:13,162 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:02:13,162 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:02:13,162 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration8_Lasso [2021-12-15 17:02:13,162 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:02:13,162 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:02:13,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-15 17:02:13,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-15 17:02:13,174 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-15 17:02:13,176 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-15 17:02:13,187 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-15 17:02:13,395 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-15 17:02:13,397 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-15 17:02:13,399 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-15 17:02:13,400 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-15 17:02:13,401 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-15 17:02:13,403 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-15 17:02:13,405 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-15 17:02:13,406 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-15 17:02:13,407 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-15 17:02:13,408 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-15 17:02:13,410 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-15 17:02:13,411 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-15 17:02:13,412 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-15 17:02:13,715 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:02:13,715 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:02:13,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:13,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:13,716 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-15 17:02:13,724 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-15 17:02:13,725 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-15 17:02:13,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:13,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:13,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:13,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:13,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:13,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:13,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:13,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:13,747 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-15 17:02:13,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:13,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:13,748 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-15 17:02:13,749 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-15 17:02:13,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-15 17:02:13,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:13,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:13,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:13,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:13,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:13,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:13,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:13,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:13,772 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-15 17:02:13,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:13,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:13,773 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-15 17:02:13,773 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-15 17:02:13,775 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-15 17:02:13,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:13,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:13,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:13,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:13,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:13,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:13,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:13,798 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-15 17:02:13,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:13,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:13,799 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-15 17:02:13,800 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-15 17:02:13,801 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-15 17:02:13,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:13,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:13,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:13,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:13,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:13,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:13,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:13,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:13,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:13,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:13,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:13,828 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-15 17:02:13,828 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-15 17:02:13,830 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-15 17:02:13,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:13,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:13,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:13,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:13,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:13,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:13,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:13,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-12-15 17:02:13,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:13,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:13,860 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-15 17:02:13,860 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-15 17:02:13,861 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-15 17:02:13,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:13,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:13,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:13,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:13,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:13,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:13,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:13,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:13,889 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:13,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:13,890 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-15 17:02:13,891 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-15 17:02:13,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-15 17:02:13,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:13,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:13,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:13,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:13,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:13,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:13,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:13,970 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-15 17:02:13,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:13,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:13,971 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-15 17:02:13,972 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-15 17:02:13,973 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-15 17:02:13,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:13,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:13,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:13,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:13,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:13,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:13,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:14,002 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-15 17:02:14,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:14,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:14,003 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-15 17:02:14,003 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-15 17:02:14,005 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-15 17:02:14,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:14,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:14,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:14,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:14,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:14,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:14,017 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:02:14,022 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-15 17:02:14,023 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-15 17:02:14,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:14,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:14,024 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-15 17:02:14,024 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-15 17:02:14,034 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:02:14,040 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:02:14,040 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:02:14,040 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-15 17:02:14,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:14,087 INFO L297 tatePredicateManager]: 18 out of 20 supporting invariants were superfluous and have been removed [2021-12-15 17:02:14,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:14,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 17:02:14,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:14,165 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-15 17:02:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:14,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:14,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:14,291 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-15 17:02:14,292 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-15 17:02:14,292 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-15 17:02:14,309 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-15 17:02:14,311 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-15 17:02:14,311 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-15 17:02:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:02:14,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 21 letters. Loop has 2 letters. [2021-12-15 17:02:14,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:14,312 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:14,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:14,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 17:02:14,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:14,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:14,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:14,473 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-15 17:02:14,474 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-15 17:02:14,474 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-15 17:02:14,491 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-15 17:02:14,492 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-15 17:02:14,492 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-15 17:02:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:02:14,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 21 letters. Loop has 2 letters. [2021-12-15 17:02:14,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:14,493 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:14,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:14,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 17:02:14,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:14,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:14,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:14,661 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-15 17:02:14,661 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-15 17:02:14,661 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-15 17:02:14,730 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-15 17:02:14,731 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-15 17:02:14,731 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-15 17:02:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2021-12-15 17:02:14,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 21 letters. Loop has 2 letters. [2021-12-15 17:02:14,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:14,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 23 letters. Loop has 2 letters. [2021-12-15 17:02:14,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:14,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 21 letters. Loop has 4 letters. [2021-12-15 17:02:14,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:14,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2021-12-15 17:02:14,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:14,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 38 states and 46 transitions. [2021-12-15 17:02:14,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:02:14,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-15 17:02:14,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2021-12-15 17:02:14,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:14,733 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-12-15 17:02:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2021-12-15 17:02:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2021-12-15 17:02:14,734 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-15 17:02:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-12-15 17:02:14,734 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-15 17:02:14,734 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-15 17:02:14,734 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:02:14,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2021-12-15 17:02:14,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:14,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:14,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:14,735 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:14,735 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:14,735 INFO L791 eck$LassoCheckResult]: Stem: 1578#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1579#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; 1580#L561 assume !(main_~array_size~0#1 < 1); 1581#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; 1582#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; 1583#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 1593#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; 1592#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1591#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1590#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; 1588#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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; 1586#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; 1587#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1589#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); 1603#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1602#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; 1601#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1600#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); 1597#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1596#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; 1594#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1573#L552-3 [2021-12-15 17:02:14,735 INFO L793 eck$LassoCheckResult]: Loop: 1573#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); 1574#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; 1573#L552-3 [2021-12-15 17:02:14,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:14,736 INFO L85 PathProgramCache]: Analyzing trace with hash 776867019, now seen corresponding path program 6 times [2021-12-15 17:02:14,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:14,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856463138] [2021-12-15 17:02:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:14,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:14,799 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-15 17:02:14,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:02:14,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856463138] [2021-12-15 17:02:14,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856463138] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:02:14,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188462066] [2021-12-15 17:02:14,800 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 17:02:14,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:02:14,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:14,801 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-15 17:02:14,801 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-15 17:02:14,843 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-15 17:02:14,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:02:14,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 17:02:14,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:14,975 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-15 17:02:14,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:02:15,025 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-15 17:02:15,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188462066] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:02:15,025 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:02:15,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2021-12-15 17:02:15,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198802263] [2021-12-15 17:02:15,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:02:15,025 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:02:15,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:15,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 6 times [2021-12-15 17:02:15,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:15,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767608112] [2021-12-15 17:02:15,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:15,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:15,032 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:15,034 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:15,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:02:15,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 17:02:15,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-12-15 17:02:15,060 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-15 17:02:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:02:15,174 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2021-12-15 17:02:15,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 17:02:15,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 61 transitions. [2021-12-15 17:02:15,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:15,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 35 states and 41 transitions. [2021-12-15 17:02:15,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:02:15,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-15 17:02:15,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2021-12-15 17:02:15,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:15,176 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2021-12-15 17:02:15,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2021-12-15 17:02:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-12-15 17:02:15,177 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-15 17:02:15,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2021-12-15 17:02:15,178 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-12-15 17:02:15,178 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-12-15 17:02:15,178 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 17:02:15,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2021-12-15 17:02:15,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:15,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:15,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:15,179 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:15,179 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:15,179 INFO L791 eck$LassoCheckResult]: Stem: 1836#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1837#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; 1838#L561 assume !(main_~array_size~0#1 < 1); 1839#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; 1840#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; 1841#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 1846#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; 1859#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1858#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; 1855#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1854#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1849#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; 1847#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1848#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); 1863#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1844#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; 1845#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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; 1856#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; 1862#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1861#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); 1853#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1852#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; 1850#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1831#L552-3 [2021-12-15 17:02:15,179 INFO L793 eck$LassoCheckResult]: Loop: 1831#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); 1832#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; 1831#L552-3 [2021-12-15 17:02:15,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:15,181 INFO L85 PathProgramCache]: Analyzing trace with hash -914443991, now seen corresponding path program 7 times [2021-12-15 17:02:15,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:15,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592811854] [2021-12-15 17:02:15,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:15,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:15,195 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:15,209 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:15,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:15,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 7 times [2021-12-15 17:02:15,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:15,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884145863] [2021-12-15 17:02:15,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:15,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:15,213 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:15,215 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:15,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:15,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1687621486, now seen corresponding path program 3 times [2021-12-15 17:02:15,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:15,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931278499] [2021-12-15 17:02:15,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:15,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:15,225 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:15,235 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:15,768 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:02:15,768 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:02:15,768 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:02:15,768 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:02:15,768 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:02:15,769 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:15,769 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:02:15,769 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:02:15,769 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration10_Lasso [2021-12-15 17:02:15,769 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:02:15,769 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:02:15,770 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-15 17:02:15,772 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-15 17:02:15,774 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-15 17:02:15,775 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-15 17:02:15,790 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-15 17:02:15,792 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-15 17:02:15,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-15 17:02:15,794 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-15 17:02:15,796 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-15 17:02:15,797 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-15 17:02:15,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-15 17:02:15,800 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-15 17:02:15,801 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-15 17:02:15,802 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-15 17:02:16,086 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-15 17:02:16,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-15 17:02:16,089 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-15 17:02:16,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-15 17:02:16,092 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-15 17:02:16,397 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:02:16,398 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:02:16,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,399 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-15 17:02:16,399 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-15 17:02:16,401 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-15 17:02:16,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:16,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:16,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:16,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:16,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:16,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:16,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:16,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2021-12-15 17:02:16,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,434 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-15 17:02:16,435 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-15 17:02:16,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-15 17:02:16,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:16,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:16,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:16,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:16,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:16,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:16,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:16,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:16,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,461 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-15 17:02:16,462 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-15 17:02:16,463 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-15 17:02:16,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:16,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:16,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:16,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:16,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:16,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:16,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:16,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:16,484 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-15 17:02:16,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,485 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-15 17:02:16,486 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-15 17:02:16,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-15 17:02:16,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:16,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:16,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:16,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:16,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:16,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:16,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:16,511 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-15 17:02:16,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,512 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-15 17:02:16,513 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-15 17:02:16,514 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-15 17:02:16,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:16,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:16,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:16,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:16,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:16,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:16,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:16,522 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:16,537 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-15 17:02:16,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,538 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-15 17:02:16,538 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-15 17:02:16,540 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-15 17:02:16,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:16,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:16,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:16,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:16,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:16,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:16,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:16,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:16,562 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-15 17:02:16,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,563 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-15 17:02:16,567 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-15 17:02:16,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-15 17:02:16,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:16,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:16,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:16,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:16,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:16,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:16,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:16,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:16,593 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-15 17:02:16,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,594 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-15 17:02:16,595 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-15 17:02:16,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-15 17:02:16,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:16,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:16,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:16,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:16,629 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:16,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:16,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:16,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2021-12-15 17:02:16,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,646 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-15 17:02:16,647 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-15 17:02:16,649 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-15 17:02:16,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:16,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:16,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:16,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:16,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:16,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:16,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:16,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:16,674 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-15 17:02:16,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,675 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-15 17:02:16,682 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-15 17:02:16,683 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-15 17:02:16,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:16,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:16,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:16,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:16,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:16,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:16,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:16,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:16,754 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-15 17:02:16,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,755 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-15 17:02:16,755 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-15 17:02:16,757 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-15 17:02:16,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:16,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:16,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:16,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:16,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:16,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:16,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:16,780 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-15 17:02:16,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,781 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-15 17:02:16,781 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-15 17:02:16,782 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-15 17:02:16,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:16,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:16,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:16,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:16,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:16,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:16,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:16,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:16,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2021-12-15 17:02:16,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,805 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-15 17:02:16,805 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-15 17:02:16,807 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-15 17:02:16,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:16,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:16,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:16,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:16,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:16,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:16,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:16,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:16,830 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-15 17:02:16,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,831 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-15 17:02:16,831 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-15 17:02:16,832 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-15 17:02:16,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:16,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:16,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:16,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:16,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:16,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:16,847 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:02:16,853 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-15 17:02:16,853 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-15 17:02:16,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:16,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:16,862 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-15 17:02:16,863 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:02:16,872 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-15 17:02:16,881 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:02:16,881 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:02:16,881 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-15 17:02:16,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2021-12-15 17:02:16,950 INFO L297 tatePredicateManager]: 31 out of 33 supporting invariants were superfluous and have been removed [2021-12-15 17:02:16,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:16,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-15 17:02:16,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:17,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:17,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:17,270 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-15 17:02:17,270 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-15 17:02:17,270 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-15 17:02:17,331 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-15 17:02:17,332 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-15 17:02:17,332 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-15 17:02:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2021-12-15 17:02:17,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 27 letters. Loop has 2 letters. [2021-12-15 17:02:17,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:17,333 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:17,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:17,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-15 17:02:17,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:17,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:17,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:17,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-15 17:02:17,629 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-15 17:02:17,630 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-15 17:02:17,691 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-15 17:02:17,717 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-15 17:02:17,718 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-15 17:02:17,718 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-15 17:02:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2021-12-15 17:02:17,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 27 letters. Loop has 2 letters. [2021-12-15 17:02:17,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:17,719 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:17,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-15 17:02:17,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:17,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:17,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:17,999 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-15 17:02:17,999 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-15 17:02:17,999 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-15 17:02:18,139 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-15 17:02:18,140 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-15 17:02:18,140 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-15 17:02:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 59 transitions. [2021-12-15 17:02:18,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 59 transitions. Stem has 27 letters. Loop has 2 letters. [2021-12-15 17:02:18,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:18,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 59 transitions. Stem has 29 letters. Loop has 2 letters. [2021-12-15 17:02:18,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:18,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 59 transitions. Stem has 27 letters. Loop has 4 letters. [2021-12-15 17:02:18,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:18,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 102 transitions. [2021-12-15 17:02:18,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-15 17:02:18,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 76 states and 95 transitions. [2021-12-15 17:02:18,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-15 17:02:18,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-15 17:02:18,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 95 transitions. [2021-12-15 17:02:18,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:18,143 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 95 transitions. [2021-12-15 17:02:18,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 95 transitions. [2021-12-15 17:02:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 43. [2021-12-15 17:02:18,145 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-15 17:02:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2021-12-15 17:02:18,145 INFO L704 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2021-12-15 17:02:18,145 INFO L587 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2021-12-15 17:02:18,145 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-15 17:02:18,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2021-12-15 17:02:18,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:18,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:18,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:18,147 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:18,147 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:18,147 INFO L791 eck$LassoCheckResult]: Stem: 2544#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2545#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; 2546#L561 assume !(main_~array_size~0#1 < 1); 2547#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; 2535#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; 2536#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 2548#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; 2558#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);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; 2577#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; 2555#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2554#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2553#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; 2551#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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; 2549#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; 2550#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2569#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); 2568#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 2567#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; 2566#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2564#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); 2562#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 2561#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; 2559#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2539#L552-3 [2021-12-15 17:02:18,147 INFO L793 eck$LassoCheckResult]: Loop: 2539#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); 2540#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; 2539#L552-3 [2021-12-15 17:02:18,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:18,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1528280583, now seen corresponding path program 8 times [2021-12-15 17:02:18,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:18,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528611584] [2021-12-15 17:02:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:18,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:18,157 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:18,166 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:18,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:18,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 8 times [2021-12-15 17:02:18,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:18,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479893090] [2021-12-15 17:02:18,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:18,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:18,169 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:18,171 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:18,172 INFO L85 PathProgramCache]: Analyzing trace with hash -201173812, now seen corresponding path program 4 times [2021-12-15 17:02:18,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:18,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817401039] [2021-12-15 17:02:18,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:18,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:18,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:18,191 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:18,875 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:02:18,875 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:02:18,875 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:02:18,875 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:02:18,875 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:02:18,875 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:18,875 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:02:18,875 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:02:18,875 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration11_Lasso [2021-12-15 17:02:18,875 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:02:18,875 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:02:18,877 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-15 17:02:18,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-15 17:02:18,880 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-15 17:02:18,881 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-15 17:02:18,892 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-15 17:02:18,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-15 17:02:18,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-15 17:02:18,897 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-15 17:02:18,898 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-15 17:02:18,899 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-15 17:02:18,900 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-15 17:02:19,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-15 17:02:19,186 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-15 17:02:19,188 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-15 17:02:19,189 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-15 17:02:19,190 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-15 17:02:19,191 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-15 17:02:19,192 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-15 17:02:19,483 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:02:19,483 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:02:19,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,484 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-15 17:02:19,485 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-15 17:02:19,486 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-15 17:02:19,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:19,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:19,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2021-12-15 17:02:19,509 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,510 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-15 17:02:19,511 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-15 17:02:19,512 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-15 17:02:19,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:19,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:19,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:19,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2021-12-15 17:02:19,535 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,536 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-15 17:02:19,537 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-15 17:02:19,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-15 17:02:19,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:19,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:19,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:19,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:19,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,561 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-15 17:02:19,562 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-15 17:02:19,563 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-15 17:02:19,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:19,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:19,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2021-12-15 17:02:19,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,588 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-15 17:02:19,589 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-15 17:02:19,590 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-15 17:02:19,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:19,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:19,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,622 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-15 17:02:19,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,623 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-15 17:02:19,623 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-15 17:02:19,625 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-15 17:02:19,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:19,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:19,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:19,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,646 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-15 17:02:19,647 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,647 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-15 17:02:19,656 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-15 17:02:19,656 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-15 17:02:19,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:19,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:19,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:19,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,684 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-15 17:02:19,685 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-15 17:02:19,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-15 17:02:19,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:19,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:19,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:19,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,709 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-15 17:02:19,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,711 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-15 17:02:19,711 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-15 17:02:19,713 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-15 17:02:19,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:19,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:19,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:19,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,739 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-15 17:02:19,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,740 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-15 17:02:19,741 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-15 17:02:19,742 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-15 17:02:19,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:19,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:19,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:19,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,772 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-15 17:02:19,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,773 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-15 17:02:19,774 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-15 17:02:19,775 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-15 17:02:19,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:19,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:19,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2021-12-15 17:02:19,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,801 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-15 17:02:19,801 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-15 17:02:19,803 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-15 17:02:19,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:19,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:19,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,830 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-15 17:02:19,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,832 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-15 17:02:19,833 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-15 17:02:19,853 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-15 17:02:19,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:19,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:19,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:19,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,882 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-15 17:02:19,883 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-15 17:02:19,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-15 17:02:19,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:19,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:19,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,911 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-15 17:02:19,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,912 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-15 17:02:19,913 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-15 17:02:19,914 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-15 17:02:19,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:19,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:19,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,968 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-15 17:02:19,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,969 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-15 17:02:19,970 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-15 17:02:19,971 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-15 17:02:19,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:19,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:19,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:19,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:19,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:19,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:19,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:19,995 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-15 17:02:19,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:19,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:19,996 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-15 17:02:19,997 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-15 17:02:19,999 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-15 17:02:20,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:20,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:20,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:20,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:20,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:20,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:20,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:20,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:20,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:20,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:20,027 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-15 17:02:20,029 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-15 17:02:20,029 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-15 17:02:20,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:20,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:20,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:20,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:20,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:20,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:20,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:20,064 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-15 17:02:20,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:20,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:20,065 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-15 17:02:20,066 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-15 17:02:20,067 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-15 17:02:20,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:20,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:20,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:20,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:20,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:20,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:20,107 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:02:20,113 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-15 17:02:20,113 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-15 17:02:20,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:20,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:20,114 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-15 17:02:20,115 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-15 17:02:20,116 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:02:20,143 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:02:20,144 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:02:20,144 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-15 17:02:20,160 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-15 17:02:20,250 INFO L297 tatePredicateManager]: 38 out of 40 supporting invariants were superfluous and have been removed [2021-12-15 17:02:20,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:20,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 17:02:20,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:20,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:20,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:20,454 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-15 17:02:20,455 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-15 17:02:20,455 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-15 17:02:20,473 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-15 17:02:20,474 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-15 17:02:20,474 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-15 17:02:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:02:20,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 29 letters. Loop has 2 letters. [2021-12-15 17:02:20,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:20,474 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:20,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:20,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 17:02:20,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:20,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:20,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:20,687 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-15 17:02:20,688 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-15 17:02:20,688 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-15 17:02:20,708 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-15 17:02:20,708 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-15 17:02:20,708 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-15 17:02:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:02:20,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 29 letters. Loop has 2 letters. [2021-12-15 17:02:20,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:20,709 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:20,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:20,768 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-15 17:02:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:20,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 17:02:20,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:20,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:20,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:20,958 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-15 17:02:20,959 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-15 17:02:20,959 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-15 17:02:21,032 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-15 17:02:21,032 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-15 17:02:21,032 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-15 17:02:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2021-12-15 17:02:21,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 29 letters. Loop has 2 letters. [2021-12-15 17:02:21,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:21,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 31 letters. Loop has 2 letters. [2021-12-15 17:02:21,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:21,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 29 letters. Loop has 4 letters. [2021-12-15 17:02:21,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:21,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 99 transitions. [2021-12-15 17:02:21,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:21,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 89 transitions. [2021-12-15 17:02:21,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-15 17:02:21,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-15 17:02:21,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 89 transitions. [2021-12-15 17:02:21,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:21,034 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 89 transitions. [2021-12-15 17:02:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 89 transitions. [2021-12-15 17:02:21,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2021-12-15 17:02:21,036 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-15 17:02:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2021-12-15 17:02:21,036 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-15 17:02:21,036 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-15 17:02:21,036 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-15 17:02:21,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2021-12-15 17:02:21,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:21,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:21,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:21,037 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:21,037 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:21,038 INFO L791 eck$LassoCheckResult]: Stem: 3260#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3261#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; 3262#L561 assume !(main_~array_size~0#1 < 1); 3263#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; 3264#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; 3265#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 3270#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; 3282#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3281#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; 3279#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3278#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3274#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; 3271#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3272#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); 3292#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3291#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; 3273#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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; 3268#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; 3269#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3289#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); 3288#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3287#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; 3286#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3283#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); 3280#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3277#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); 3255#L552-3 [2021-12-15 17:02:21,038 INFO L793 eck$LassoCheckResult]: Loop: 3255#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); 3256#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; 3255#L552-3 [2021-12-15 17:02:21,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:21,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1693390338, now seen corresponding path program 9 times [2021-12-15 17:02:21,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:21,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425085706] [2021-12-15 17:02:21,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:21,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:21,115 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-15 17:02:21,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:02:21,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425085706] [2021-12-15 17:02:21,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425085706] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:02:21,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261572886] [2021-12-15 17:02:21,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 17:02:21,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:02:21,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:21,119 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-15 17:02:21,141 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-15 17:02:21,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-15 17:02:21,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:02:21,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-15 17:02:21,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:21,318 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-15 17:02:21,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:02:21,375 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-15 17:02:21,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261572886] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:02:21,375 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:02:21,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2021-12-15 17:02:21,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344232562] [2021-12-15 17:02:21,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:02:21,376 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:02:21,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:21,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 9 times [2021-12-15 17:02:21,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:21,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373975872] [2021-12-15 17:02:21,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:21,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:21,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:21,381 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:21,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:02:21,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-15 17:02:21,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-12-15 17:02:21,407 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-15 17:02:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:02:21,510 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2021-12-15 17:02:21,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 17:02:21,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 75 transitions. [2021-12-15 17:02:21,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:21,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 42 states and 49 transitions. [2021-12-15 17:02:21,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:02:21,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-15 17:02:21,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2021-12-15 17:02:21,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:21,512 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2021-12-15 17:02:21,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2021-12-15 17:02:21,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-12-15 17:02:21,513 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-15 17:02:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2021-12-15 17:02:21,514 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2021-12-15 17:02:21,514 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2021-12-15 17:02:21,514 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-15 17:02:21,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2021-12-15 17:02:21,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:21,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:21,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:21,515 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:21,515 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:21,515 INFO L791 eck$LassoCheckResult]: Stem: 3578#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3579#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; 3580#L561 assume !(main_~array_size~0#1 < 1); 3581#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; 3582#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; 3583#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 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; 3599#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3598#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; 3596#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3595#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3590#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; 3588#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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; 3586#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; 3587#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3589#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); 3612#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3611#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; 3610#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3608#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); 3607#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3606#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; 3605#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3604#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); 3594#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3593#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; 3591#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3573#L552-3 [2021-12-15 17:02:21,515 INFO L793 eck$LassoCheckResult]: Loop: 3573#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); 3574#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; 3573#L552-3 [2021-12-15 17:02:21,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:21,516 INFO L85 PathProgramCache]: Analyzing trace with hash -54505508, now seen corresponding path program 10 times [2021-12-15 17:02:21,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:21,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651318568] [2021-12-15 17:02:21,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:21,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:21,526 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:21,535 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:21,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:21,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 10 times [2021-12-15 17:02:21,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:21,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007163861] [2021-12-15 17:02:21,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:21,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:21,538 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:21,539 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:21,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:21,540 INFO L85 PathProgramCache]: Analyzing trace with hash -840184479, now seen corresponding path program 5 times [2021-12-15 17:02:21,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:21,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063694143] [2021-12-15 17:02:21,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:21,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:21,553 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:21,572 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:22,321 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:02:22,321 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:02:22,321 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:02:22,321 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:02:22,322 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:02:22,322 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:22,322 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:02:22,322 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:02:22,322 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration13_Lasso [2021-12-15 17:02:22,322 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:02:22,322 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:02:22,323 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-15 17:02:22,325 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-15 17:02:22,326 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-15 17:02:22,327 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-15 17:02:22,329 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-15 17:02:22,330 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-15 17:02:22,331 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-15 17:02:22,340 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-15 17:02:22,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-15 17:02:22,342 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-15 17:02:22,344 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-15 17:02:22,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-15 17:02:22,347 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-15 17:02:22,348 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-15 17:02:22,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-15 17:02:22,351 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-15 17:02:22,352 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-15 17:02:22,702 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-15 17:02:22,982 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:02:22,982 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:02:22,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:22,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:22,983 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-15 17:02:22,985 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-15 17:02:22,985 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-15 17:02:22,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:22,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:22,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:22,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:22,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:22,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:22,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:22,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,008 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-15 17:02:23,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,009 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-15 17:02:23,010 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-15 17:02:23,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-15 17:02:23,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:23,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:23,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,035 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-15 17:02:23,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,036 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-15 17:02:23,036 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-15 17:02:23,038 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-15 17:02:23,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:23,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:23,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:23,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,060 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-15 17:02:23,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,061 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-15 17:02:23,062 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-15 17:02:23,063 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-15 17:02:23,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:23,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:23,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,087 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-15 17:02:23,087 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,088 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-15 17:02:23,089 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-15 17:02:23,090 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-15 17:02:23,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:23,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:23,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:23,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,113 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-15 17:02:23,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,114 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-15 17:02:23,115 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-15 17:02:23,116 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-15 17:02:23,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:23,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:23,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,152 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-15 17:02:23,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,153 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-15 17:02:23,154 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-15 17:02:23,155 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-15 17:02:23,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:23,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:23,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:23,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,178 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-15 17:02:23,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,179 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-15 17:02:23,180 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-15 17:02:23,182 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-15 17:02:23,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:23,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:23,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:23,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,205 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-15 17:02:23,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,206 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-15 17:02:23,207 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-15 17:02:23,208 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-15 17:02:23,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:23,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:23,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:23,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2021-12-15 17:02:23,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,232 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-15 17:02:23,232 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-15 17:02:23,234 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-15 17:02:23,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:23,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:23,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,259 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-15 17:02:23,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,260 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-15 17:02:23,260 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-15 17:02:23,262 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-15 17:02:23,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:23,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:23,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:23,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:23,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,286 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-15 17:02:23,286 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-15 17:02:23,288 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-15 17:02:23,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:23,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:23,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:23,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,310 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-15 17:02:23,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,311 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-15 17:02:23,311 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-15 17:02:23,313 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-15 17:02:23,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:23,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:23,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:23,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,335 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-15 17:02:23,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,337 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-15 17:02:23,337 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-15 17:02:23,339 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-15 17:02:23,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:23,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:23,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,363 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-15 17:02:23,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,364 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-15 17:02:23,364 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-15 17:02:23,366 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-15 17:02:23,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:23,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:23,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:23,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,390 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-15 17:02:23,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,391 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-15 17:02:23,391 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-15 17:02:23,392 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-15 17:02:23,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:23,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:23,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:23,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,415 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-15 17:02:23,415 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,416 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-15 17:02:23,417 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-15 17:02:23,418 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-15 17:02:23,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:23,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:23,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,455 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-15 17:02:23,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,456 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-15 17:02:23,457 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-15 17:02:23,458 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-15 17:02:23,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:23,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:23,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:23,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,485 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-15 17:02:23,485 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-15 17:02:23,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-15 17:02:23,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:23,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:23,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2021-12-15 17:02:23,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,520 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-15 17:02:23,520 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-15 17:02:23,522 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-15 17:02:23,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:23,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:23,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2021-12-15 17:02:23,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,550 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-15 17:02:23,550 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-15 17:02:23,552 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-15 17:02:23,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:23,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:23,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:23,579 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-15 17:02:23,579 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,580 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-15 17:02:23,581 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-15 17:02:23,582 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-15 17:02:23,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:23,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:23,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:23,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:23,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:23,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:23,595 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:02:23,599 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-15 17:02:23,600 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-15 17:02:23,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:23,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:23,601 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-15 17:02:23,601 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-15 17:02:23,602 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:02:23,608 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:02:23,608 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:02:23,608 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-15 17:02:23,624 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-15 17:02:23,717 INFO L297 tatePredicateManager]: 47 out of 49 supporting invariants were superfluous and have been removed [2021-12-15 17:02:23,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:23,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2021-12-15 17:02:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:23,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-15 17:02:23,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:24,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:24,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:24,154 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-15 17:02:24,154 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-15 17:02:24,154 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-15 17:02:24,234 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-15 17:02:24,234 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-15 17:02:24,234 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-15 17:02:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2021-12-15 17:02:24,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 33 letters. Loop has 2 letters. [2021-12-15 17:02:24,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:24,236 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:24,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:24,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-15 17:02:24,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:24,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:24,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:24,652 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-15 17:02:24,652 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-15 17:02:24,652 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-15 17:02:24,734 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-15 17:02:24,734 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-15 17:02:24,734 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-15 17:02:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2021-12-15 17:02:24,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 33 letters. Loop has 2 letters. [2021-12-15 17:02:24,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:24,735 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:24,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:24,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-15 17:02:24,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:25,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:25,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:25,133 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-15 17:02:25,133 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-15 17:02:25,134 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-15 17:02:25,330 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-15 17:02:25,330 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-15 17:02:25,330 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-15 17:02:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2021-12-15 17:02:25,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 33 letters. Loop has 2 letters. [2021-12-15 17:02:25,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:25,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 35 letters. Loop has 2 letters. [2021-12-15 17:02:25,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:25,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 33 letters. Loop has 4 letters. [2021-12-15 17:02:25,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:25,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 120 transitions. [2021-12-15 17:02:25,332 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-15 17:02:25,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 90 states and 113 transitions. [2021-12-15 17:02:25,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-15 17:02:25,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-15 17:02:25,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 113 transitions. [2021-12-15 17:02:25,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:25,333 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 113 transitions. [2021-12-15 17:02:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 113 transitions. [2021-12-15 17:02:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 50. [2021-12-15 17:02:25,335 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-15 17:02:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2021-12-15 17:02:25,335 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2021-12-15 17:02:25,335 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2021-12-15 17:02:25,336 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-15 17:02:25,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 59 transitions. [2021-12-15 17:02:25,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:25,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:25,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:25,337 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:25,337 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:25,337 INFO L791 eck$LassoCheckResult]: Stem: 4450#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4451#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; 4452#L561 assume !(main_~array_size~0#1 < 1); 4453#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; 4454#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; 4455#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 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; 4468#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; 4467#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);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; 4494#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; 4464#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4463#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4462#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; 4460#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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; 4458#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; 4459#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4486#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); 4485#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 4484#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; 4483#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4481#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); 4480#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 4479#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; 4478#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4477#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); 4474#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 4473#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; 4471#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4445#L552-3 [2021-12-15 17:02:25,337 INFO L793 eck$LassoCheckResult]: Loop: 4445#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); 4446#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; 4445#L552-3 [2021-12-15 17:02:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:25,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1339181510, now seen corresponding path program 11 times [2021-12-15 17:02:25,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:25,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408355127] [2021-12-15 17:02:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:25,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:25,348 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:25,360 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:25,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 11 times [2021-12-15 17:02:25,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:25,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249953243] [2021-12-15 17:02:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:25,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:25,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:25,366 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:25,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1536758847, now seen corresponding path program 6 times [2021-12-15 17:02:25,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:25,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214788251] [2021-12-15 17:02:25,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:25,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:25,376 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:25,387 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:26,454 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:02:26,454 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:02:26,454 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:02:26,454 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:02:26,454 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:02:26,454 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:26,454 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:02:26,454 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:02:26,454 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration14_Lasso [2021-12-15 17:02:26,454 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:02:26,454 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:02:26,455 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-15 17:02:26,466 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-15 17:02:26,468 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-15 17:02:26,469 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-15 17:02:26,471 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-15 17:02:26,808 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-15 17:02:26,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-15 17:02:26,810 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-15 17:02:26,812 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-15 17:02:26,814 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-15 17:02:26,815 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-15 17:02:26,817 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-15 17:02:26,818 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-15 17:02:26,819 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-15 17:02:26,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-15 17:02:26,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-15 17:02:26,823 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-15 17:02:26,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-15 17:02:27,146 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:02:27,147 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:02:27,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:27,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:27,148 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-15 17:02:27,148 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-15 17:02:27,149 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-15 17:02:27,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:27,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:27,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:27,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:27,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:27,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:27,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:27,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:27,171 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-15 17:02:27,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:27,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:27,174 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-15 17:02:27,176 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-15 17:02:27,176 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-15 17:02:27,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:27,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:27,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:27,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:27,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:27,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:27,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:27,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:27,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:27,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:27,203 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-15 17:02:27,203 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-15 17:02:27,204 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-15 17:02:27,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:27,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:27,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:27,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:27,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:27,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:27,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:27,228 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-15 17:02:27,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:27,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:27,229 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-15 17:02:27,229 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-15 17:02:27,230 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-15 17:02:27,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:27,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:27,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:27,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:27,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:27,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:27,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:27,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:27,252 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-15 17:02:27,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:27,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:27,253 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-15 17:02:27,254 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-15 17:02:27,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-15 17:02:27,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:27,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:27,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:27,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:27,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:27,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:27,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:27,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:27,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:27,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:27,281 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-15 17:02:27,281 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-15 17:02:27,283 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-15 17:02:27,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:27,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:27,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:27,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:27,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:27,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:27,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:27,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:27,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:27,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:27,310 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-15 17:02:27,310 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-15 17:02:27,312 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-15 17:02:27,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:27,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:27,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:27,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:27,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:27,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:27,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:27,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:27,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:27,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:27,340 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-15 17:02:27,340 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-15 17:02:27,342 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-15 17:02:27,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:27,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:27,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:27,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:27,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:27,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:27,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:27,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2021-12-15 17:02:27,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:27,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:27,382 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-15 17:02:27,382 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-15 17:02:27,384 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-15 17:02:27,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:27,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:27,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:27,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:27,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:27,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:27,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:27,418 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-15 17:02:27,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:27,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:27,419 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-15 17:02:27,419 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-15 17:02:27,421 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-15 17:02:27,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:27,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:27,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:27,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:27,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:27,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:27,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:27,447 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-15 17:02:27,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:27,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:27,448 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-15 17:02:27,448 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-15 17:02:27,450 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-15 17:02:27,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:27,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:27,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:27,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:27,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:27,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:27,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:27,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2021-12-15 17:02:27,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:27,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:27,478 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-15 17:02:27,479 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-15 17:02:27,480 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-15 17:02:27,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:27,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:27,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:27,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:27,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:27,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:27,503 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:02:27,509 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-15 17:02:27,509 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-15 17:02:27,509 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:27,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:27,510 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-15 17:02:27,511 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-15 17:02:27,512 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:02:27,518 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:02:27,518 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:02:27,518 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-15 17:02:27,534 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-15 17:02:27,643 INFO L297 tatePredicateManager]: 57 out of 59 supporting invariants were superfluous and have been removed [2021-12-15 17:02:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:27,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-15 17:02:27,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:27,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:27,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:27,887 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-15 17:02:27,888 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-15 17:02:27,888 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-15 17:02:27,906 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-15 17:02:27,907 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-15 17:02:27,907 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-15 17:02:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:02:27,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 35 letters. Loop has 2 letters. [2021-12-15 17:02:27,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:27,908 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:27,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:27,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-15 17:02:27,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:28,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:28,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:28,158 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-15 17:02:28,159 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-15 17:02:28,159 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-15 17:02:28,178 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-15 17:02:28,178 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-15 17:02:28,179 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-15 17:02:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:02:28,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 35 letters. Loop has 2 letters. [2021-12-15 17:02:28,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:28,179 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:28,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:28,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-15 17:02:28,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:28,391 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-15 17:02:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:28,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:28,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:28,464 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-15 17:02:28,465 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-15 17:02:28,465 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-15 17:02:28,563 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-15 17:02:28,564 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-15 17:02:28,564 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-15 17:02:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2021-12-15 17:02:28,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 35 letters. Loop has 2 letters. [2021-12-15 17:02:28,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:28,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 37 letters. Loop has 2 letters. [2021-12-15 17:02:28,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:28,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 35 letters. Loop has 4 letters. [2021-12-15 17:02:28,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:28,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 117 transitions. [2021-12-15 17:02:28,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:28,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 85 states and 107 transitions. [2021-12-15 17:02:28,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-15 17:02:28,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-15 17:02:28,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 107 transitions. [2021-12-15 17:02:28,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:28,566 INFO L681 BuchiCegarLoop]: Abstraction has 85 states and 107 transitions. [2021-12-15 17:02:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 107 transitions. [2021-12-15 17:02:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2021-12-15 17:02:28,567 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-15 17:02:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2021-12-15 17:02:28,567 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2021-12-15 17:02:28,567 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2021-12-15 17:02:28,567 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-15 17:02:28,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2021-12-15 17:02:28,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:28,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:28,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:28,568 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:28,568 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:28,568 INFO L791 eck$LassoCheckResult]: Stem: 5341#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5342#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; 5343#L561 assume !(main_~array_size~0#1 < 1); 5344#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; 5345#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; 5346#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 5351#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; 5363#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5362#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; 5360#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5359#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5355#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; 5352#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5353#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); 5380#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5379#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; 5354#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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; 5349#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; 5350#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5377#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); 5376#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5375#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; 5374#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5372#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); 5371#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5370#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; 5369#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5366#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); 5361#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5358#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); 5336#L552-3 [2021-12-15 17:02:28,568 INFO L793 eck$LassoCheckResult]: Loop: 5336#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); 5337#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; 5336#L552-3 [2021-12-15 17:02:28,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash 36566833, now seen corresponding path program 12 times [2021-12-15 17:02:28,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:28,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42046198] [2021-12-15 17:02:28,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:28,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:28,656 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-15 17:02:28,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:02:28,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42046198] [2021-12-15 17:02:28,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42046198] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:02:28,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207250819] [2021-12-15 17:02:28,657 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 17:02:28,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:02:28,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:28,658 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-15 17:02:28,659 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-15 17:02:28,726 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-15 17:02:28,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:02:28,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-15 17:02:28,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:28,889 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-15 17:02:28,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:02:28,962 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-15 17:02:28,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207250819] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:02:28,962 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:02:28,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2021-12-15 17:02:28,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709834354] [2021-12-15 17:02:28,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:02:28,963 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:02:28,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:28,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 12 times [2021-12-15 17:02:28,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:28,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692097124] [2021-12-15 17:02:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:28,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:28,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:28,972 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:29,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:02:29,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-15 17:02:29,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2021-12-15 17:02:29,001 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-15 17:02:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:02:29,140 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2021-12-15 17:02:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 17:02:29,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 89 transitions. [2021-12-15 17:02:29,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:29,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 49 states and 57 transitions. [2021-12-15 17:02:29,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:02:29,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-15 17:02:29,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 57 transitions. [2021-12-15 17:02:29,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:29,141 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2021-12-15 17:02:29,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 57 transitions. [2021-12-15 17:02:29,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2021-12-15 17:02:29,143 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-15 17:02:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2021-12-15 17:02:29,143 INFO L704 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2021-12-15 17:02:29,143 INFO L587 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2021-12-15 17:02:29,143 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-15 17:02:29,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 56 transitions. [2021-12-15 17:02:29,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:29,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:29,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:29,144 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:29,144 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:29,144 INFO L791 eck$LassoCheckResult]: Stem: 5723#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5724#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; 5725#L561 assume !(main_~array_size~0#1 < 1); 5726#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; 5714#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; 5715#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 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; 5740#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5739#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; 5736#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5735#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5731#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; 5729#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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; 5727#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; 5728#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5730#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); 5760#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5759#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; 5758#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5756#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); 5755#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5754#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; 5753#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5751#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); 5750#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5749#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; 5748#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5747#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); 5737#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5734#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; 5732#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5718#L552-3 [2021-12-15 17:02:29,144 INFO L793 eck$LassoCheckResult]: Loop: 5718#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); 5719#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; 5718#L552-3 [2021-12-15 17:02:29,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:29,145 INFO L85 PathProgramCache]: Analyzing trace with hash -643498353, now seen corresponding path program 13 times [2021-12-15 17:02:29,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:29,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608128120] [2021-12-15 17:02:29,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:29,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:29,155 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:29,164 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 13 times [2021-12-15 17:02:29,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:29,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002403913] [2021-12-15 17:02:29,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:29,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:29,167 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:29,169 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:29,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash 73374548, now seen corresponding path program 7 times [2021-12-15 17:02:29,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:29,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749371228] [2021-12-15 17:02:29,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:29,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:29,180 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:29,195 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:30,368 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:02:30,369 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:02:30,373 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:02:30,373 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:02:30,373 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:02:30,373 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:30,373 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:02:30,373 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:02:30,373 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration16_Lasso [2021-12-15 17:02:30,373 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:02:30,373 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:02:30,375 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-15 17:02:30,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-15 17:02:30,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-15 17:02:30,380 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-15 17:02:30,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-15 17:02:30,835 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-15 17:02:30,837 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-15 17:02:30,856 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-15 17:02:30,858 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-15 17:02: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-15 17:02:30,862 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-15 17:02: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-15 17:02:30,865 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-15 17:02: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-15 17:02: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-15 17:02:30,869 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-15 17:02:30,870 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-15 17:02:30,871 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-15 17:02:31,214 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:02:31,215 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:02:31,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:31,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:31,216 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-15 17:02:31,216 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-15 17:02:31,217 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-15 17:02:31,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:31,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:31,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:31,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:31,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:31,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:31,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:31,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2021-12-15 17:02:31,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:31,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:31,242 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-15 17:02:31,242 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-15 17:02:31,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-15 17:02:31,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:31,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:31,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:31,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:31,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:31,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:31,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:31,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:31,266 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-15 17:02:31,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:31,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:31,267 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-15 17:02:31,267 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-15 17:02:31,269 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-15 17:02:31,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:31,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:31,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:31,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:31,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:31,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:31,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:31,293 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-15 17:02:31,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:31,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:31,294 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-15 17:02:31,295 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-15 17:02:31,296 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-15 17:02:31,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:31,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:31,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:31,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:31,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:31,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:31,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:31,323 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-15 17:02:31,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:31,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:31,324 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-15 17:02:31,325 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-15 17:02:31,326 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-15 17:02:31,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:31,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:31,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:31,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:31,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:31,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:31,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:31,353 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-15 17:02:31,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:31,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:31,354 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-15 17:02:31,354 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-15 17:02:31,356 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-15 17:02:31,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:31,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:31,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:31,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:31,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:31,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:31,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:31,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:31,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:31,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:31,382 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-15 17:02:31,383 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-15 17:02:31,384 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-15 17:02:31,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:31,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:31,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:31,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:31,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:31,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:31,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:31,409 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-15 17:02:31,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:31,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:31,410 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-15 17:02:31,410 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-15 17:02:31,428 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-15 17:02:31,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:31,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:31,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:31,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:31,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:31,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:31,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:31,454 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-15 17:02:31,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:31,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:31,455 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-15 17:02:31,455 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-15 17:02:31,457 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-15 17:02:31,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:31,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:31,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:31,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:31,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:31,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:31,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:31,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:31,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:31,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:31,483 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-15 17:02:31,484 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-15 17:02:31,485 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-15 17:02:31,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:31,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:31,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:31,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:31,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:31,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:31,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:31,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2021-12-15 17:02:31,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:31,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:31,563 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-15 17:02:31,563 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-15 17:02:31,564 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-15 17:02:31,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:31,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:31,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:31,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:31,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:31,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:31,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:31,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:31,596 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:31,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:31,597 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-15 17:02:31,597 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-15 17:02:31,598 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-15 17:02:31,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:31,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:31,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:31,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:31,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:31,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:31,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:31,624 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-15 17:02:31,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:31,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:31,625 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-15 17:02:31,626 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-15 17:02:31,627 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-15 17:02:31,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:31,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:31,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:31,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:31,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:31,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:31,638 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:02:31,645 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-15 17:02:31,645 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-15 17:02:31,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:31,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:31,647 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-15 17:02:31,647 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-15 17:02:31,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:02:31,654 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:02:31,654 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:02:31,654 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-15 17:02:31,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:31,807 INFO L297 tatePredicateManager]: 69 out of 71 supporting invariants were superfluous and have been removed [2021-12-15 17:02:31,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:31,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-15 17:02:31,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:32,017 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-15 17:02:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:32,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:32,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:32,314 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-15 17:02:32,315 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-15 17:02:32,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-15 17:02:32,403 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-15 17:02:32,403 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-15 17:02:32,404 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-15 17:02:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2021-12-15 17:02:32,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 26 transitions. Stem has 39 letters. Loop has 2 letters. [2021-12-15 17:02:32,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:32,404 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:32,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:32,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-15 17:02:32,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:32,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:32,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:32,874 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-15 17:02:32,875 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-15 17:02:32,875 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-15 17:02:32,996 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-15 17:02:32,996 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-15 17:02:32,997 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-15 17:02:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2021-12-15 17:02:32,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 26 transitions. Stem has 39 letters. Loop has 2 letters. [2021-12-15 17:02:32,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:32,998 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:33,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:33,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-15 17:02:33,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:33,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:33,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:33,479 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-15 17:02:33,479 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-15 17:02:33,479 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-15 17:02:33,687 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-15 17:02:33,690 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-15 17:02:33,690 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-15 17:02:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 75 transitions. [2021-12-15 17:02:33,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 75 transitions. Stem has 39 letters. Loop has 2 letters. [2021-12-15 17:02:33,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:33,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 75 transitions. Stem has 41 letters. Loop has 2 letters. [2021-12-15 17:02:33,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:33,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 75 transitions. Stem has 39 letters. Loop has 4 letters. [2021-12-15 17:02:33,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:33,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 138 transitions. [2021-12-15 17:02:33,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-15 17:02:33,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 104 states and 131 transitions. [2021-12-15 17:02:33,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-15 17:02:33,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-15 17:02:33,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 131 transitions. [2021-12-15 17:02:33,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:33,693 INFO L681 BuchiCegarLoop]: Abstraction has 104 states and 131 transitions. [2021-12-15 17:02:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 131 transitions. [2021-12-15 17:02:33,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 57. [2021-12-15 17:02:33,694 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-15 17:02:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2021-12-15 17:02:33,695 INFO L704 BuchiCegarLoop]: Abstraction has 57 states and 67 transitions. [2021-12-15 17:02:33,695 INFO L587 BuchiCegarLoop]: Abstraction has 57 states and 67 transitions. [2021-12-15 17:02:33,695 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-15 17:02:33,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 67 transitions. [2021-12-15 17:02:33,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:33,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:33,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:33,696 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:33,696 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:33,696 INFO L791 eck$LassoCheckResult]: Stem: 6783#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6784#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; 6785#L561 assume !(main_~array_size~0#1 < 1); 6786#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; 6787#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; 6788#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6789#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; 6790#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6805#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; 6804#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6803#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; 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; 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; 6798#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; 6799#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6834#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; 6797#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6796#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6795#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; 6793#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6780#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); 6781#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6791#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; 6792#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6826#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); 6825#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6824#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; 6823#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6821#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); 6820#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6819#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; 6818#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6816#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); 6815#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6814#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; 6813#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6812#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); 6809#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6808#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; 6806#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6778#L552-3 [2021-12-15 17:02:33,696 INFO L793 eck$LassoCheckResult]: Loop: 6778#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); 6779#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; 6778#L552-3 [2021-12-15 17:02:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1351113107, now seen corresponding path program 14 times [2021-12-15 17:02:33,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:33,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200071843] [2021-12-15 17:02:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:33,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:33,707 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:33,716 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:33,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:33,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 14 times [2021-12-15 17:02:33,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:33,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095724561] [2021-12-15 17:02:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:33,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:33,720 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:33,722 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:33,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:33,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1339571278, now seen corresponding path program 8 times [2021-12-15 17:02:33,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:33,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398592568] [2021-12-15 17:02:33,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:33,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:33,732 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:33,743 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:35,413 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:02:35,413 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:02:35,413 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:02:35,413 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:02:35,413 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:02:35,413 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:35,413 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:02:35,413 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:02:35,413 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration17_Lasso [2021-12-15 17:02:35,413 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:02:35,413 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:02:35,415 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-15 17:02:35,416 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-15 17:02:35,897 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-15 17:02:35,899 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-15 17:02:35,900 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-15 17:02:35,902 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-15 17:02:35,903 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-15 17:02:35,904 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-15 17:02:35,905 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-15 17:02:35,907 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-15 17:02:35,909 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-15 17:02:35,910 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-15 17:02:35,912 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-15 17:02:35,913 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-15 17:02:35,914 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-15 17:02:35,916 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-15 17:02:35,917 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-15 17:02:35,924 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-15 17:02:35,926 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-15 17:02:36,270 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:02:36,271 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:02:36,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:36,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:36,272 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-15 17:02:36,272 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-15 17:02:36,274 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-15 17:02:36,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:36,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:36,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:36,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:36,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:36,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:36,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:36,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:36,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:36,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:36,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:36,299 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-15 17:02:36,300 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-15 17:02:36,335 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-15 17:02:36,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:36,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:36,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:36,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:36,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:36,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:36,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:36,360 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-15 17:02:36,360 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:36,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:36,362 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-15 17:02:36,362 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-15 17:02:36,364 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-15 17:02:36,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:36,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:36,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:36,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:36,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:36,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:36,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:36,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2021-12-15 17:02:36,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:36,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:36,392 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-15 17:02:36,392 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-15 17:02:36,393 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-15 17:02:36,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:36,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:36,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:36,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:36,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:36,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:36,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:36,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:36,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:36,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:36,423 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-15 17:02:36,424 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-15 17:02:36,424 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-15 17:02:36,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:36,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:36,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:36,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:36,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:36,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:36,437 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:02:36,442 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-15 17:02:36,442 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-15 17:02:36,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:36,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:36,443 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-15 17:02:36,444 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-15 17:02:36,445 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:02:36,451 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:02:36,451 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:02:36,451 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-15 17:02:36,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2021-12-15 17:02:36,622 INFO L297 tatePredicateManager]: 81 out of 83 supporting invariants were superfluous and have been removed [2021-12-15 17:02:36,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:36,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-15 17:02:36,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:36,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:36,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:36,917 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-15 17:02:36,918 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-15 17:02:36,918 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-15 17:02:36,937 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-15 17:02:36,938 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-15 17:02:36,938 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-15 17:02:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:02:36,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 41 letters. Loop has 2 letters. [2021-12-15 17:02:36,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:36,938 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:36,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:36,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-15 17:02:36,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:37,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:37,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:37,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:37,265 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-15 17:02:37,265 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-15 17:02:37,266 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-15 17:02:37,289 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-15 17:02:37,294 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-15 17:02:37,294 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-15 17:02:37,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:02:37,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 41 letters. Loop has 2 letters. [2021-12-15 17:02:37,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:37,295 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:37,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:37,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-15 17:02:37,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:37,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:37,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:37,575 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-15 17:02:37,575 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-15 17:02:37,576 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-15 17:02:37,688 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-15 17:02:37,692 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-15 17:02:37,692 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-15 17:02:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2021-12-15 17:02:37,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 41 letters. Loop has 2 letters. [2021-12-15 17:02:37,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:37,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 43 letters. Loop has 2 letters. [2021-12-15 17:02:37,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:37,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 41 letters. Loop has 4 letters. [2021-12-15 17:02:37,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:37,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 135 transitions. [2021-12-15 17:02:37,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:37,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 99 states and 125 transitions. [2021-12-15 17:02:37,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-15 17:02:37,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-15 17:02:37,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 125 transitions. [2021-12-15 17:02:37,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:37,694 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 125 transitions. [2021-12-15 17:02:37,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 125 transitions. [2021-12-15 17:02:37,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 53. [2021-12-15 17:02:37,696 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-15 17:02:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2021-12-15 17:02:37,696 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-12-15 17:02:37,697 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-12-15 17:02:37,697 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-15 17:02:37,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2021-12-15 17:02:37,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:37,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:37,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:37,698 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:37,698 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:37,698 INFO L791 eck$LassoCheckResult]: Stem: 7860#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7861#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; 7862#L561 assume !(main_~array_size~0#1 < 1); 7863#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; 7864#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; 7865#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 7873#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);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; 7885#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7884#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 7879#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; 7876#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7877#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); 7911#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 7910#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; 7878#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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; 7874#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; 7875#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7908#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); 7907#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 7906#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; 7905#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7903#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); 7902#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 7901#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; 7900#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7898#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); 7897#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 7896#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; 7895#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7892#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); 7883#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 7882#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); 7868#L552-3 [2021-12-15 17:02:37,698 INFO L793 eck$LassoCheckResult]: Loop: 7868#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); 7869#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; 7868#L552-3 [2021-12-15 17:02:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1793463396, now seen corresponding path program 15 times [2021-12-15 17:02:37,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:37,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844058311] [2021-12-15 17:02:37,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:37,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:37,810 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-15 17:02:37,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:02:37,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844058311] [2021-12-15 17:02:37,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844058311] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:02:37,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138063083] [2021-12-15 17:02:37,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 17:02:37,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:02:37,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:37,812 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-15 17:02:37,812 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-15 17:02:37,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-12-15 17:02:37,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:02:37,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 17:02:37,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:38,075 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-15 17:02:38,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:02:38,151 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-15 17:02:38,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138063083] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:02:38,151 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:02:38,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2021-12-15 17:02:38,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564753124] [2021-12-15 17:02:38,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:02:38,152 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:02:38,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:38,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 15 times [2021-12-15 17:02:38,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:38,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142839439] [2021-12-15 17:02:38,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:38,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:38,155 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:38,157 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:38,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:02:38,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-15 17:02:38,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2021-12-15 17:02:38,184 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-15 17:02:38,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:02:38,359 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2021-12-15 17:02:38,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 17:02:38,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 103 transitions. [2021-12-15 17:02:38,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:38,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 56 states and 65 transitions. [2021-12-15 17:02:38,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:02:38,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-15 17:02:38,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 65 transitions. [2021-12-15 17:02:38,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:38,360 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 65 transitions. [2021-12-15 17:02:38,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 65 transitions. [2021-12-15 17:02:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2021-12-15 17:02:38,361 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-15 17:02:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2021-12-15 17:02:38,362 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-12-15 17:02:38,362 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-12-15 17:02:38,362 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-12-15 17:02:38,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 64 transitions. [2021-12-15 17:02:38,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:38,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:38,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:38,362 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:38,362 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:38,363 INFO L791 eck$LassoCheckResult]: Stem: 8298#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8299#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; 8300#L561 assume !(main_~array_size~0#1 < 1); 8301#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; 8302#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; 8303#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 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; 8324#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8323#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; 8321#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8320#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 8315#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; 8313#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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; 8311#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; 8312#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8314#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); 8351#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8350#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; 8349#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8347#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); 8346#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8345#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; 8344#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8342#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); 8341#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8340#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; 8339#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8337#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); 8336#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8335#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; 8334#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8333#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); 8319#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8318#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; 8316#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8306#L552-3 [2021-12-15 17:02:38,363 INFO L793 eck$LassoCheckResult]: Loop: 8306#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); 8307#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; 8306#L552-3 [2021-12-15 17:02:38,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:38,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1162190146, now seen corresponding path program 16 times [2021-12-15 17:02:38,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:38,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154932540] [2021-12-15 17:02:38,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:38,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:38,383 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:38,407 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:38,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:38,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 16 times [2021-12-15 17:02:38,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:38,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151672346] [2021-12-15 17:02:38,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:38,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:38,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:38,414 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:38,414 INFO L85 PathProgramCache]: Analyzing trace with hash 173234503, now seen corresponding path program 9 times [2021-12-15 17:02:38,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:38,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006787335] [2021-12-15 17:02:38,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:38,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:38,428 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:38,443 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:40,049 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:02:40,049 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:02:40,049 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:02:40,049 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:02:40,049 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:02:40,050 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:40,050 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:02:40,050 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:02:40,050 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration19_Lasso [2021-12-15 17:02:40,050 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:02:40,050 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:02:40,051 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-15 17:02:40,052 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-15 17:02:40,054 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-15 17:02:40,055 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-15 17:02:40,056 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-15 17:02:40,561 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-15 17:02:40,562 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-15 17:02:40,564 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-15 17:02:40,565 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-15 17:02:40,567 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-15 17:02:40,568 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-15 17:02:40,570 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-15 17:02:40,571 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-15 17:02:40,572 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-15 17:02:40,574 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-15 17:02:40,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-15 17:02:40,576 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-15 17:02:40,578 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-15 17:02:40,944 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:02:40,944 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:02:40,945 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:40,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:40,945 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-15 17:02:40,946 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-15 17:02:40,947 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-15 17:02:40,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:40,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:40,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:40,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:40,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:40,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:40,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:40,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:40,969 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-15 17:02:40,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:40,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:40,970 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-15 17:02:40,971 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-15 17:02:40,972 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-15 17:02:40,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:40,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:40,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:40,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:40,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:40,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:40,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:40,995 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-15 17:02:40,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:40,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:40,996 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-15 17:02:40,997 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-15 17:02:40,998 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-15 17:02:41,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:41,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:41,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:41,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:41,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:41,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:41,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:41,005 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:41,020 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-15 17:02:41,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:41,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:41,021 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-15 17:02:41,021 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-15 17:02:41,023 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-15 17:02:41,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:41,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:41,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:41,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:41,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:41,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:41,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:41,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:41,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:41,046 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:41,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:41,046 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-15 17:02:41,047 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-15 17:02:41,048 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-15 17:02:41,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:41,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:41,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:41,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:41,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:41,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:41,060 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:41,076 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-15 17:02:41,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:41,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:41,077 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-15 17:02:41,077 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-15 17:02:41,079 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-15 17:02:41,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:41,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:41,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:41,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:41,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:41,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:41,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:41,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:41,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:41,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:41,106 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-15 17:02:41,107 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-15 17:02:41,108 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-15 17:02:41,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:41,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:41,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:41,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:41,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:41,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:41,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:41,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2021-12-15 17:02:41,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:41,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:41,135 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-15 17:02:41,136 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-15 17:02:41,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-15 17:02:41,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:41,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:41,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:41,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:41,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:41,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:41,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:41,171 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-15 17:02:41,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:41,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:41,172 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-15 17:02:41,173 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-15 17:02:41,174 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-15 17:02:41,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:41,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:41,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:41,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:41,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:41,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:41,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:41,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2021-12-15 17:02:41,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:41,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:41,202 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-15 17:02:41,202 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-15 17:02:41,203 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-15 17:02:41,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:41,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:41,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:41,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:41,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:41,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:41,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:41,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2021-12-15 17:02:41,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:41,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:41,231 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-15 17:02:41,231 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-15 17:02:41,233 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-15 17:02:41,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:41,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:41,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:41,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:41,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:41,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:41,244 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:02:41,251 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-15 17:02:41,251 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-15 17:02:41,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:41,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:41,252 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-15 17:02:41,253 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-15 17:02:41,254 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:02:41,260 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:02:41,260 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:02:41,260 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-15 17:02:41,276 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-15 17:02:41,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:41,480 INFO L297 tatePredicateManager]: 93 out of 95 supporting invariants were superfluous and have been removed [2021-12-15 17:02:41,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:41,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-15 17:02:41,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:41,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:41,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:41,846 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-15 17:02:41,846 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-15 17:02:41,846 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-15 17:02:41,869 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-15 17:02:41,869 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-15 17:02:41,869 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-15 17:02:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:02:41,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 45 letters. Loop has 2 letters. [2021-12-15 17:02:41,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:41,870 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:41,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:41,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-15 17:02:41,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:42,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:42,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:42,199 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-15 17:02:42,200 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-15 17:02:42,200 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-15 17:02:42,222 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-15 17:02:42,222 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-15 17:02:42,222 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-15 17:02:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:02:42,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 45 letters. Loop has 2 letters. [2021-12-15 17:02:42,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:42,223 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:42,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:42,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-15 17:02:42,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:42,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:42,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:42,557 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-15 17:02:42,558 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-15 17:02:42,558 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-15 17:02:42,676 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-15 17:02:42,676 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-15 17:02:42,676 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-15 17:02:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2021-12-15 17:02:42,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 45 letters. Loop has 2 letters. [2021-12-15 17:02:42,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:42,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 47 letters. Loop has 2 letters. [2021-12-15 17:02:42,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:42,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 45 letters. Loop has 4 letters. [2021-12-15 17:02:42,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:42,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 93 transitions. [2021-12-15 17:02:42,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:42,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 86 transitions. [2021-12-15 17:02:42,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:02:42,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-15 17:02:42,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 86 transitions. [2021-12-15 17:02:42,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:42,678 INFO L681 BuchiCegarLoop]: Abstraction has 70 states and 86 transitions. [2021-12-15 17:02:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 86 transitions. [2021-12-15 17:02:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2021-12-15 17:02:42,680 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-15 17:02:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2021-12-15 17:02:42,680 INFO L704 BuchiCegarLoop]: Abstraction has 60 states and 70 transitions. [2021-12-15 17:02:42,680 INFO L587 BuchiCegarLoop]: Abstraction has 60 states and 70 transitions. [2021-12-15 17:02:42,680 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-12-15 17:02:42,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 70 transitions. [2021-12-15 17:02:42,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:42,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:42,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:42,681 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:42,681 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:42,681 INFO L791 eck$LassoCheckResult]: Stem: 9436#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9437#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; 9438#L561 assume !(main_~array_size~0#1 < 1); 9439#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; 9440#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; 9441#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 9446#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);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; 9452#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9451#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 9450#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; 9447#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9448#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); 9489#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9488#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; 9449#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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); 9435#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9444#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; 9445#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9486#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); 9485#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9484#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; 9483#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9481#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); 9480#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9479#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; 9478#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9476#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); 9475#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9474#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; 9473#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9471#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); 9470#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9469#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; 9468#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9467#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); 9464#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9463#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; 9461#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9431#L552-3 [2021-12-15 17:02:42,681 INFO L793 eck$LassoCheckResult]: Loop: 9431#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); 9432#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; 9431#L552-3 [2021-12-15 17:02:42,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:42,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1025367657, now seen corresponding path program 17 times [2021-12-15 17:02:42,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:42,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720248290] [2021-12-15 17:02:42,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:42,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:42,831 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-15 17:02:42,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:02:42,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720248290] [2021-12-15 17:02:42,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720248290] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:02:42,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259134090] [2021-12-15 17:02:42,831 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 17:02:42,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:02:42,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:42,832 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-15 17:02:42,833 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-15 17:02:42,924 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-12-15 17:02:42,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:02:42,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 17:02:42,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:43,144 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-15 17:02:43,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:02:43,221 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-15 17:02:43,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259134090] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:02:43,222 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:02:43,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2021-12-15 17:02:43,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507553243] [2021-12-15 17:02:43,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:02:43,222 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:02:43,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:43,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 17 times [2021-12-15 17:02:43,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:43,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473296849] [2021-12-15 17:02:43,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:43,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:43,227 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:43,229 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:43,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:02:43,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-15 17:02:43,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2021-12-15 17:02:43,271 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-15 17:02:43,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:02:43,458 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2021-12-15 17:02:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 17:02:43,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 117 transitions. [2021-12-15 17:02:43,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:43,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 63 states and 73 transitions. [2021-12-15 17:02:43,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:02:43,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-15 17:02:43,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 73 transitions. [2021-12-15 17:02:43,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:43,459 INFO L681 BuchiCegarLoop]: Abstraction has 63 states and 73 transitions. [2021-12-15 17:02:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 73 transitions. [2021-12-15 17:02:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-12-15 17:02:43,460 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-15 17:02:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2021-12-15 17:02:43,461 INFO L704 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2021-12-15 17:02:43,461 INFO L587 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2021-12-15 17:02:43,461 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-12-15 17:02:43,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 72 transitions. [2021-12-15 17:02:43,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:43,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:43,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:43,462 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:43,462 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:43,462 INFO L791 eck$LassoCheckResult]: Stem: 9934#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9935#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; 9936#L561 assume !(main_~array_size~0#1 < 1); 9937#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; 9938#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; 9939#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 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; 9955#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9954#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; 9952#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9951#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 9946#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; 9944#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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; 9942#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; 9943#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9945#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); 9989#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9988#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; 9987#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9985#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); 9984#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9983#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; 9982#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9980#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); 9979#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9978#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; 9977#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9975#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); 9974#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9973#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; 9972#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9970#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); 9969#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9968#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; 9967#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9966#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); 9950#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9949#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; 9947#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9929#L552-3 [2021-12-15 17:02:43,462 INFO L793 eck$LassoCheckResult]: Loop: 9929#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); 9930#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; 9929#L552-3 [2021-12-15 17:02:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:43,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1227033589, now seen corresponding path program 18 times [2021-12-15 17:02:43,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:43,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731008121] [2021-12-15 17:02:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:43,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:43,476 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:43,487 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:43,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 18 times [2021-12-15 17:02:43,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:43,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825374579] [2021-12-15 17:02:43,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:43,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:43,491 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:43,493 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:43,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:43,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1936726214, now seen corresponding path program 10 times [2021-12-15 17:02:43,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:43,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414883836] [2021-12-15 17:02:43,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:43,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:43,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:43,518 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:45,865 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:02:45,865 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:02:45,865 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:02:45,865 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:02:45,865 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:02:45,865 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:45,865 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:02:45,865 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:02:45,865 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration21_Lasso [2021-12-15 17:02:45,865 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:02:45,865 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:02:45,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-15 17:02:45,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-15 17:02:45,869 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-15 17:02:45,871 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-15 17:02:46,538 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-15 17:02:46,540 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-15 17:02:46,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-15 17:02:46,542 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-15 17:02:46,544 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-15 17:02:46,545 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-15 17:02:46,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-15 17:02:46,548 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-15 17:02:46,549 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-15 17:02:46,550 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-15 17:02:46,552 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-15 17:02:46,553 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-15 17:02:46,555 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-15 17:02:46,556 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-15 17:02:46,930 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:02:46,930 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:02:46,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:46,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:46,932 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-15 17:02:46,932 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-15 17:02:46,934 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-15 17:02:46,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:46,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:46,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:46,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:46,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:46,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:46,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:46,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:46,968 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-15 17:02:46,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:46,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:46,969 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-15 17:02:46,970 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-15 17:02:46,971 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-15 17:02:46,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:46,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:46,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:46,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:46,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:46,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:46,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:46,994 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-15 17:02:46,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:46,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:46,995 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-15 17:02:46,995 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-15 17:02:46,997 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-15 17:02:47,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:47,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:47,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:47,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:47,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:47,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:47,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:47,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:47,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2021-12-15 17:02:47,018 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:47,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:47,019 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-15 17:02:47,020 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-15 17:02:47,021 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-15 17:02:47,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:47,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:47,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:47,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:47,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:47,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:47,038 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:47,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:47,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:47,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:47,054 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-15 17:02:47,055 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-15 17:02:47,057 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-15 17:02:47,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:47,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:47,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:47,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:47,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:47,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:47,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:47,084 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-15 17:02:47,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:47,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:47,085 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-15 17:02:47,085 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-15 17:02:47,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-15 17:02:47,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:47,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:47,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:47,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:47,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:47,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:47,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:47,112 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-15 17:02:47,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:47,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:47,113 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-15 17:02:47,114 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-15 17:02:47,115 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-15 17:02:47,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:47,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:47,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:47,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:47,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:47,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:47,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:47,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2021-12-15 17:02:47,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:47,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:47,142 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-15 17:02:47,142 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-15 17:02:47,143 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-15 17:02:47,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:47,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:47,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:47,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:47,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:47,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:47,155 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:02:47,163 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-12-15 17:02:47,163 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-15 17:02:47,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:47,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:47,164 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-15 17:02:47,165 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-15 17:02:47,166 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:02:47,172 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:02:47,172 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:02:47,172 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-15 17:02:47,187 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-15 17:02:47,382 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-15 17:02:47,507 INFO L297 tatePredicateManager]: 122 out of 124 supporting invariants were superfluous and have been removed [2021-12-15 17:02:47,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:47,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-15 17:02:47,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:47,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:47,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:47,898 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-15 17:02:47,898 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-15 17:02:47,898 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-15 17:02:47,923 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-15 17:02:47,923 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-15 17:02:47,924 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-15 17:02:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:02:47,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 51 letters. Loop has 2 letters. [2021-12-15 17:02:47,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:47,924 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:47,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:47,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-15 17:02:47,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:48,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:48,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:48,289 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-15 17:02:48,289 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-15 17:02:48,289 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-15 17:02:48,323 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-15 17:02:48,323 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-15 17:02:48,324 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-15 17:02:48,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:02:48,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 51 letters. Loop has 2 letters. [2021-12-15 17:02:48,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:48,324 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:48,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:48,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-15 17:02:48,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:48,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:48,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:48,702 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-15 17:02:48,702 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-15 17:02:48,702 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-15 17:02:48,857 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-15 17:02:48,858 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-15 17:02:48,858 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-15 17:02:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2021-12-15 17:02:48,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 65 transitions. Stem has 51 letters. Loop has 2 letters. [2021-12-15 17:02:48,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:48,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 65 transitions. Stem has 53 letters. Loop has 2 letters. [2021-12-15 17:02:48,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:48,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 65 transitions. Stem has 51 letters. Loop has 4 letters. [2021-12-15 17:02:48,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:48,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 103 transitions. [2021-12-15 17:02:48,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:48,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 78 states and 96 transitions. [2021-12-15 17:02:48,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:02:48,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-15 17:02:48,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 96 transitions. [2021-12-15 17:02:48,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:48,860 INFO L681 BuchiCegarLoop]: Abstraction has 78 states and 96 transitions. [2021-12-15 17:02:48,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 96 transitions. [2021-12-15 17:02:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2021-12-15 17:02:48,861 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-15 17:02:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2021-12-15 17:02:48,862 INFO L704 BuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2021-12-15 17:02:48,862 INFO L587 BuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2021-12-15 17:02:48,862 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-12-15 17:02:48,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 78 transitions. [2021-12-15 17:02:48,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:48,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:48,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:48,863 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:48,863 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:48,863 INFO L791 eck$LassoCheckResult]: Stem: 11272#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11273#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; 11274#L561 assume !(main_~array_size~0#1 < 1); 11275#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; 11276#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; 11277#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 11282#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);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; 11288#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11287#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 11286#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; 11283#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11284#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); 11332#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11331#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; 11285#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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; 11280#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; 11281#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11329#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); 11328#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11327#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; 11326#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11324#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); 11323#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11322#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; 11321#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11319#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); 11318#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11317#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; 11316#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11314#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); 11313#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11312#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; 11311#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11309#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); 11308#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11307#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; 11306#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11305#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); 11302#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11301#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; 11299#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11267#L552-3 [2021-12-15 17:02:48,863 INFO L793 eck$LassoCheckResult]: Loop: 11267#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); 11268#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; 11267#L552-3 [2021-12-15 17:02:48,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:48,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1473052982, now seen corresponding path program 19 times [2021-12-15 17:02:48,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:48,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064788646] [2021-12-15 17:02:48,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:48,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:49,008 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-15 17:02:49,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:02:49,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064788646] [2021-12-15 17:02:49,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064788646] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:02:49,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419199826] [2021-12-15 17:02:49,008 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 17:02:49,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:02:49,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:49,009 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-15 17:02:49,010 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-15 17:02:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:49,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-15 17:02:49,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:49,351 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-15 17:02:49,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:02:49,465 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-15 17:02:49,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419199826] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:02:49,465 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:02:49,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 31 [2021-12-15 17:02:49,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046792840] [2021-12-15 17:02:49,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:02:49,465 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:02:49,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:49,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 19 times [2021-12-15 17:02:49,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:49,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357452759] [2021-12-15 17:02:49,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:49,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:49,471 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:49,482 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:49,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:02:49,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-15 17:02:49,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2021-12-15 17:02:49,511 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-15 17:02:49,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:02:49,731 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2021-12-15 17:02:49,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 17:02:49,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 131 transitions. [2021-12-15 17:02:49,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:49,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 70 states and 81 transitions. [2021-12-15 17:02:49,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:02:49,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-15 17:02:49,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 81 transitions. [2021-12-15 17:02:49,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:49,733 INFO L681 BuchiCegarLoop]: Abstraction has 70 states and 81 transitions. [2021-12-15 17:02:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 81 transitions. [2021-12-15 17:02:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2021-12-15 17:02:49,734 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-15 17:02:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2021-12-15 17:02:49,734 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2021-12-15 17:02:49,734 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2021-12-15 17:02:49,734 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-12-15 17:02:49,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2021-12-15 17:02:49,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:49,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:49,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:49,735 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:49,735 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:49,735 INFO L791 eck$LassoCheckResult]: Stem: 11830#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11831#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; 11832#L561 assume !(main_~array_size~0#1 < 1); 11833#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; 11834#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; 11835#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 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; 11851#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11850#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; 11848#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11847#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 11842#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; 11840#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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; 11838#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; 11839#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11841#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); 11892#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11891#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; 11890#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11888#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); 11887#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11886#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; 11885#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11883#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); 11882#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11881#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; 11880#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11878#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); 11877#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11876#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; 11875#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11873#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); 11872#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11871#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; 11870#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11868#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); 11867#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11866#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; 11865#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11864#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); 11846#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 11845#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; 11843#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11825#L552-3 [2021-12-15 17:02:49,735 INFO L793 eck$LassoCheckResult]: Loop: 11825#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); 11826#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; 11825#L552-3 [2021-12-15 17:02:49,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:49,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1562782376, now seen corresponding path program 20 times [2021-12-15 17:02:49,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:49,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284046041] [2021-12-15 17:02:49,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:49,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:49,784 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:49,800 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:49,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:49,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 20 times [2021-12-15 17:02:49,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:49,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330200325] [2021-12-15 17:02:49,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:49,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:49,803 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:49,805 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:49,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:49,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1404689107, now seen corresponding path program 11 times [2021-12-15 17:02:49,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:49,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063627961] [2021-12-15 17:02:49,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:49,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:49,820 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:49,839 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:53,380 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:02:53,380 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:02:53,380 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:02:53,380 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:02:53,380 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:02:53,380 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:53,380 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:02:53,380 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:02:53,381 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration23_Lasso [2021-12-15 17:02:53,381 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:02:53,381 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:02:53,382 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-15 17:02:53,383 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-15 17:02:53,384 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-15 17:02:53,385 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-15 17:02:53,386 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-15 17:02:54,453 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-15 17:02:54,455 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-15 17:02:54,457 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-15 17:02:54,458 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-15 17:02:54,459 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-15 17:02:54,461 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-15 17:02:54,462 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-15 17:02:54,463 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-15 17:02:54,464 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-15 17:02:54,466 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-15 17:02:54,467 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-15 17:02:54,468 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-15 17:02:54,470 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-15 17:02:54,884 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:02:54,884 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:02:54,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:54,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:54,892 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-15 17:02:54,893 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-15 17:02:54,894 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-15 17:02:54,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:54,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:54,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:54,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:54,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:54,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:54,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:54,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:54,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2021-12-15 17:02:54,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:54,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:54,917 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-15 17:02:54,917 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-15 17:02:54,919 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-15 17:02:54,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:54,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:54,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:54,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:54,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:54,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:54,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:54,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:54,940 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-15 17:02:54,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:54,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:54,941 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-15 17:02:54,941 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-15 17:02:54,943 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-15 17:02:54,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:54,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:54,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:54,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:54,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:54,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:54,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:54,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:54,964 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-15 17:02:54,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:54,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:54,965 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-15 17:02:54,966 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-15 17:02:54,967 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-15 17:02:54,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:54,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:02:54,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:54,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:54,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:54,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:02:54,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:02:54,974 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:54,988 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-15 17:02:54,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:54,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:54,990 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-15 17:02:54,990 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-15 17:02:54,991 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-15 17:02:54,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:54,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:54,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:54,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:54,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:54,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:55,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:55,018 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-15 17:02:55,018 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:55,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:55,019 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-15 17:02:55,020 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-15 17:02:55,022 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-15 17:02:55,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:55,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:55,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:55,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:55,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:55,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:55,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:55,048 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-15 17:02:55,048 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:55,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:55,049 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-15 17:02:55,050 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-15 17:02:55,051 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-15 17:02:55,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:55,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:55,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:55,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:55,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:55,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:55,062 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:55,077 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-15 17:02:55,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:55,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:55,078 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-15 17:02:55,081 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-15 17:02:55,082 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-15 17:02:55,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:55,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:55,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:55,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:55,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:55,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:55,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:55,114 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-15 17:02:55,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:55,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:55,115 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-15 17:02:55,116 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-15 17:02:55,117 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-15 17:02:55,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:55,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:55,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:55,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:55,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:55,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:55,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:55,157 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-15 17:02:55,157 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:55,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:55,158 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-15 17:02:55,158 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-15 17:02:55,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-15 17:02:55,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:55,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:55,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:55,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:55,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:55,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:55,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:02:55,206 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-15 17:02:55,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:55,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:55,207 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-15 17:02:55,208 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-15 17:02:55,210 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-15 17:02:55,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:02:55,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:02:55,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:02:55,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:02:55,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:02:55,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:02:55,241 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:02:55,247 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-15 17:02:55,247 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-15 17:02:55,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:02:55,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:02:55,249 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-15 17:02:55,250 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-15 17:02:55,252 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:02:55,268 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:02:55,269 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:02:55,269 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-15 17:02:55,285 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-15 17:02:55,748 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-15 17:02:55,823 INFO L297 tatePredicateManager]: 156 out of 158 supporting invariants were superfluous and have been removed [2021-12-15 17:02:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:55,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-15 17:02:55,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:56,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:56,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:56,496 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-15 17:02:56,497 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-15 17:02:56,497 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-15 17:02:56,638 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-15 17:02:56,639 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-15 17:02:56,639 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-15 17:02:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2021-12-15 17:02:56,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 32 transitions. Stem has 57 letters. Loop has 2 letters. [2021-12-15 17:02:56,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:56,639 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:56,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:56,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-15 17:02:56,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:57,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:57,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:57,317 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-15 17:02:57,318 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-15 17:02:57,318 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-15 17:02:57,428 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-15 17:02:57,428 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-15 17:02:57,428 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-15 17:02:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2021-12-15 17:02:57,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 32 transitions. Stem has 57 letters. Loop has 2 letters. [2021-12-15 17:02:57,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:57,429 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:02:57,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:57,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-15 17:02:57,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:02:58,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:02:58,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:02:58,128 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-15 17:02:58,129 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-15 17:02:58,129 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-15 17:02:58,547 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-15 17:02:58,547 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-15 17:02:58,547 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-15 17:02:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 99 transitions. [2021-12-15 17:02:58,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 99 transitions. Stem has 57 letters. Loop has 2 letters. [2021-12-15 17:02:58,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:58,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 99 transitions. Stem has 59 letters. Loop has 2 letters. [2021-12-15 17:02:58,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:58,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 99 transitions. Stem has 57 letters. Loop has 4 letters. [2021-12-15 17:02:58,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:02:58,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 192 transitions. [2021-12-15 17:02:58,550 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-15 17:02:58,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 146 states and 185 transitions. [2021-12-15 17:02:58,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-15 17:02:58,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-15 17:02:58,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 185 transitions. [2021-12-15 17:02:58,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:02:58,551 INFO L681 BuchiCegarLoop]: Abstraction has 146 states and 185 transitions. [2021-12-15 17:02:58,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 185 transitions. [2021-12-15 17:02:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 78. [2021-12-15 17:02:58,552 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-15 17:02:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2021-12-15 17:02:58,552 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2021-12-15 17:02:58,552 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2021-12-15 17:02:58,552 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-12-15 17:02:58,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 91 transitions. [2021-12-15 17:02:58,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:02:58,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:02:58,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:02:58,553 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2021-12-15 17:02:58,553 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:02:58,553 INFO L791 eck$LassoCheckResult]: Stem: 13549#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13550#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; 13551#L561 assume !(main_~array_size~0#1 < 1); 13552#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; 13553#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; 13554#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 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; 13562#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; 13573#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; 13572#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);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; 13626#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; 13569#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13568#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 13567#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; 13565#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 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; 13563#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; 13564#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13618#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); 13617#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13616#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; 13615#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13613#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); 13612#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13611#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; 13610#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13608#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); 13607#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13606#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; 13605#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13603#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); 13602#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13601#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; 13600#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13598#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); 13597#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13596#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; 13595#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13593#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); 13592#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13591#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; 13590#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13589#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); 13586#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 13585#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; 13583#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13557#L552-3 [2021-12-15 17:02:58,554 INFO L793 eck$LassoCheckResult]: Loop: 13557#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); 13558#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; 13557#L552-3 [2021-12-15 17:02:58,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:58,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1577199866, now seen corresponding path program 21 times [2021-12-15 17:02:58,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:58,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999096762] [2021-12-15 17:02:58,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:58,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:58,567 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:58,579 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:58,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:58,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 21 times [2021-12-15 17:02:58,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:58,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97325179] [2021-12-15 17:02:58,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:58,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:58,583 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:58,585 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:02:58,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:02:58,585 INFO L85 PathProgramCache]: Analyzing trace with hash 434385419, now seen corresponding path program 12 times [2021-12-15 17:02:58,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:02:58,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733565870] [2021-12-15 17:02:58,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:02:58,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:02:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:58,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:02:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:02:58,613 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:03,916 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:03:03,916 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:03:03,916 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:03:03,916 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:03:03,916 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:03:03,916 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:03,916 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:03:03,916 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:03:03,916 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration24_Lasso [2021-12-15 17:03:03,916 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:03:03,916 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:03:03,918 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-15 17:03:03,919 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-15 17:03:03,920 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-15 17:03:03,922 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-15 17:03:03,923 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-15 17:03:03,924 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-15 17:03:03,925 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-15 17:03:03,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-15 17:03:03,933 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-15 17:03:03,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-15 17:03:03,936 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-15 17:03:03,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-15 17:03:03,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-15 17:03:03,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-15 17:03:03,942 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-15 17:03:03,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-15 17:03:03,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-15 17:03:03,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-15 17:03:05,257 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:03:05,257 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:03:05,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,259 INFO L229 MonitoredProcess]: Starting monitored process 197 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-15 17:03:05,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2021-12-15 17:03:05,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-15 17:03:05,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:05,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:05,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:05,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2021-12-15 17:03:05,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,294 INFO L229 MonitoredProcess]: Starting monitored process 198 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-15 17:03:05,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2021-12-15 17:03:05,296 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-15 17:03:05,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:05,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:05,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:05,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:05,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,319 INFO L229 MonitoredProcess]: Starting monitored process 199 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-15 17:03:05,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2021-12-15 17:03:05,321 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-15 17:03:05,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:05,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:05,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:05,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,345 INFO L229 MonitoredProcess]: Starting monitored process 200 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-15 17:03:05,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2021-12-15 17:03:05,347 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-15 17:03:05,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:05,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:05,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:05,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2021-12-15 17:03:05,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,370 INFO L229 MonitoredProcess]: Starting monitored process 201 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-15 17:03:05,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2021-12-15 17:03:05,372 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-15 17:03:05,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:05,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:05,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:05,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:05,395 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,396 INFO L229 MonitoredProcess]: Starting monitored process 202 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-15 17:03:05,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2021-12-15 17:03:05,397 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-15 17:03:05,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:05,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:05,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:05,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:05,420 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,421 INFO L229 MonitoredProcess]: Starting monitored process 203 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-15 17:03:05,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2021-12-15 17:03:05,422 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-15 17:03:05,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:05,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:05,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:05,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:05,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,460 INFO L229 MonitoredProcess]: Starting monitored process 204 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-15 17:03:05,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2021-12-15 17:03:05,462 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-15 17:03:05,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:05,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:05,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:05,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:05,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,485 INFO L229 MonitoredProcess]: Starting monitored process 205 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-15 17:03:05,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2021-12-15 17:03:05,493 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-15 17:03:05,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:05,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:05,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:05,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,519 INFO L229 MonitoredProcess]: Starting monitored process 206 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-15 17:03:05,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2021-12-15 17:03:05,520 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-15 17:03:05,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:05,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:05,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2021-12-15 17:03:05,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,546 INFO L229 MonitoredProcess]: Starting monitored process 207 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-15 17:03:05,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2021-12-15 17:03:05,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-15 17:03:05,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:05,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:05,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:05,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,573 INFO L229 MonitoredProcess]: Starting monitored process 208 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-15 17:03:05,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2021-12-15 17:03:05,575 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-15 17:03:05,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:05,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:05,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:05,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2021-12-15 17:03:05,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,599 INFO L229 MonitoredProcess]: Starting monitored process 209 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-15 17:03:05,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2021-12-15 17:03:05,601 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-15 17:03:05,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:05,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:05,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:05,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2021-12-15 17:03:05,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,624 INFO L229 MonitoredProcess]: Starting monitored process 210 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-15 17:03:05,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2021-12-15 17:03:05,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-15 17:03:05,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:05,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:05,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2021-12-15 17:03:05,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,651 INFO L229 MonitoredProcess]: Starting monitored process 211 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-15 17:03:05,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2021-12-15 17:03:05,653 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-15 17:03:05,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:05,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:05,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:05,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Ended with exit code 0 [2021-12-15 17:03:05,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,677 INFO L229 MonitoredProcess]: Starting monitored process 212 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-15 17:03:05,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2021-12-15 17:03:05,678 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-15 17:03:05,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:05,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:05,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:05,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2021-12-15 17:03:05,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,713 INFO L229 MonitoredProcess]: Starting monitored process 213 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-15 17:03:05,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2021-12-15 17:03:05,714 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-15 17:03:05,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:05,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:05,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:05,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2021-12-15 17:03:05,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,740 INFO L229 MonitoredProcess]: Starting monitored process 214 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-15 17:03:05,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2021-12-15 17:03:05,741 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-15 17:03:05,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:05,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:05,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:05,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:05,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:05,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:05,753 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:03:05,758 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-15 17:03:05,758 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2021-12-15 17:03:05,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:05,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:05,759 INFO L229 MonitoredProcess]: Starting monitored process 215 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-15 17:03:05,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2021-12-15 17:03:05,761 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:03:05,767 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:03:05,768 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:03:05,768 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 32))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 32))_1 Supporting invariants [] [2021-12-15 17:03:05,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Ended with exit code 0 [2021-12-15 17:03:05,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Ended with exit code 0 [2021-12-15 17:03:06,271 INFO L297 tatePredicateManager]: 173 out of 175 supporting invariants were superfluous and have been removed [2021-12-15 17:03:06,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:06,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-15 17:03:06,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:06,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:03:06,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:06,688 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-15 17:03:06,688 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-15 17:03:06,688 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 91 transitions. cyclomatic complexity: 25 Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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-15 17:03:06,727 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 91 transitions. cyclomatic complexity: 25. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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 80 states and 95 transitions. Complement of second has 4 states. [2021-12-15 17:03:06,728 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-15 17:03:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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-15 17:03:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:03:06,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 59 letters. Loop has 2 letters. [2021-12-15 17:03:06,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:06,728 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:03:06,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:06,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-15 17:03:06,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:07,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:03:07,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:07,141 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-15 17:03:07,142 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-15 17:03:07,142 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 91 transitions. cyclomatic complexity: 25 Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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-15 17:03:07,167 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 91 transitions. cyclomatic complexity: 25. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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 80 states and 95 transitions. Complement of second has 4 states. [2021-12-15 17:03:07,167 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-15 17:03:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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-15 17:03:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-15 17:03:07,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 59 letters. Loop has 2 letters. [2021-12-15 17:03:07,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:07,168 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:03:07,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:07,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-15 17:03:07,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:07,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:03:07,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:07,584 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-15 17:03:07,585 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-15 17:03:07,585 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 91 transitions. cyclomatic complexity: 25 Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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-15 17:03:07,756 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 91 transitions. cyclomatic complexity: 25. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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 148 states and 189 transitions. Complement of second has 24 states. [2021-12-15 17:03:07,756 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-15 17:03:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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-15 17:03:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2021-12-15 17:03:07,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 71 transitions. Stem has 59 letters. Loop has 2 letters. [2021-12-15 17:03:07,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:07,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 71 transitions. Stem has 61 letters. Loop has 2 letters. [2021-12-15 17:03:07,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:07,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 71 transitions. Stem has 59 letters. Loop has 4 letters. [2021-12-15 17:03:07,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:07,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 189 transitions. [2021-12-15 17:03:07,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:03:07,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 141 states and 179 transitions. [2021-12-15 17:03:07,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-15 17:03:07,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-15 17:03:07,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 179 transitions. [2021-12-15 17:03:07,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:03:07,759 INFO L681 BuchiCegarLoop]: Abstraction has 141 states and 179 transitions. [2021-12-15 17:03:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 179 transitions. [2021-12-15 17:03:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 74. [2021-12-15 17:03:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.162162162162162) internal successors, (86), 73 states have internal predecessors, (86), 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-15 17:03:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2021-12-15 17:03:07,761 INFO L704 BuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2021-12-15 17:03:07,761 INFO L587 BuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2021-12-15 17:03:07,761 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-12-15 17:03:07,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2021-12-15 17:03:07,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:03:07,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:07,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:07,762 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2021-12-15 17:03:07,762 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:03:07,762 INFO L791 eck$LassoCheckResult]: Stem: 15293#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15294#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; 15295#L561 assume !(main_~array_size~0#1 < 1); 15296#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; 15284#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; 15285#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15286#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; 15287#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15297#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; 15321#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15320#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; 15319#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15318#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; 15317#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15316#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; 15315#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15314#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; 15313#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15312#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; 15311#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15310#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; 15309#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15308#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 15303#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; 15300#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15301#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); 15356#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15355#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; 15302#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15290#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); 15291#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15298#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; 15299#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15353#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); 15352#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15351#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; 15350#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15348#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); 15347#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15346#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; 15345#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15343#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); 15342#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15341#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; 15340#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15338#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); 15337#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15336#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; 15335#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15333#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); 15332#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15331#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; 15330#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15328#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); 15327#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15326#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; 15325#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15322#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); 15307#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15306#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; 15304#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15288#L552-3 [2021-12-15 17:03:07,762 INFO L793 eck$LassoCheckResult]: Loop: 15288#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); 15289#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; 15288#L552-3 [2021-12-15 17:03:07,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:07,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1286501379, now seen corresponding path program 22 times [2021-12-15 17:03:07,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:07,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992852411] [2021-12-15 17:03:07,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:07,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 120 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:03:07,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:07,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992852411] [2021-12-15 17:03:07,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992852411] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:03:07,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046264674] [2021-12-15 17:03:07,947 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 17:03:07,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:03:07,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:07,948 INFO L229 MonitoredProcess]: Starting monitored process 216 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:03:07,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (216)] Waiting until timeout for monitored process [2021-12-15 17:03:08,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 17:03:08,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:03:08,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-15 17:03:08,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 153 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:03:08,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:03:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 153 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:03:08,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046264674] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:03:08,456 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:03:08,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 34 [2021-12-15 17:03:08,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718643028] [2021-12-15 17:03:08,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:03:08,457 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:03:08,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:08,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 22 times [2021-12-15 17:03:08,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:08,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727747882] [2021-12-15 17:03:08,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:08,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:08,460 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:08,463 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:08,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:03:08,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-15 17:03:08,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=921, Unknown=0, NotChecked=0, Total=1190 [2021-12-15 17:03:08,490 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. cyclomatic complexity: 24 Second operand has 35 states, 34 states have (on average 3.1470588235294117) internal successors, (107), 35 states have internal predecessors, (107), 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-15 17:03:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:03:08,728 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2021-12-15 17:03:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-15 17:03:08,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 145 transitions. [2021-12-15 17:03:08,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:03:08,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 77 states and 89 transitions. [2021-12-15 17:03:08,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:03:08,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-15 17:03:08,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 89 transitions. [2021-12-15 17:03:08,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:03:08,730 INFO L681 BuchiCegarLoop]: Abstraction has 77 states and 89 transitions. [2021-12-15 17:03:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 89 transitions. [2021-12-15 17:03:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2021-12-15 17:03:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 75 states have internal predecessors, (88), 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-15 17:03:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2021-12-15 17:03:08,731 INFO L704 BuchiCegarLoop]: Abstraction has 76 states and 88 transitions. [2021-12-15 17:03:08,731 INFO L587 BuchiCegarLoop]: Abstraction has 76 states and 88 transitions. [2021-12-15 17:03:08,731 INFO L425 BuchiCegarLoop]: ======== Iteration 26============ [2021-12-15 17:03:08,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 88 transitions. [2021-12-15 17:03:08,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:03:08,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:08,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:08,732 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2021-12-15 17:03:08,732 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:03:08,732 INFO L791 eck$LassoCheckResult]: Stem: 15907#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15908#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; 15909#L561 assume !(main_~array_size~0#1 < 1); 15910#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; 15911#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; 15912#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15913#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; 15914#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15941#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; 15940#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15939#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; 15938#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15937#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; 15936#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15935#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; 15934#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15933#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; 15932#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15931#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; 15930#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15929#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; 15928#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15927#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; 15925#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15924#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 15919#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; 15917#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15904#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); 15905#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15915#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; 15916#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15918#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); 15976#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15975#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; 15974#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15972#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); 15971#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15970#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; 15969#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15967#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); 15966#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15965#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; 15964#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15962#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); 15961#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15960#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; 15959#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15957#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); 15956#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15955#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; 15954#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15952#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); 15951#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15950#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; 15949#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15947#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); 15946#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15945#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; 15944#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15943#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); 15923#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15922#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; 15920#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15902#L552-3 [2021-12-15 17:03:08,732 INFO L793 eck$LassoCheckResult]: Loop: 15902#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); 15903#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; 15902#L552-3 [2021-12-15 17:03:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash 832559451, now seen corresponding path program 23 times [2021-12-15 17:03:08,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:08,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726764434] [2021-12-15 17:03:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:08,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:08,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:08,767 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:08,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:08,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 23 times [2021-12-15 17:03:08,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:08,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279493660] [2021-12-15 17:03:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:08,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:08,772 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:08,774 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1225716512, now seen corresponding path program 13 times [2021-12-15 17:03:08,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:08,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625841515] [2021-12-15 17:03:08,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:08,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:08,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:08,805 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace