./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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/twisted-alloca.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 e028c51cfa02b345902e1292d1a644c7ee4a15183825ee6e2ec2fc316df147e6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:21:49,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:21:49,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:21:50,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:21:50,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:21:50,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:21:50,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:21:50,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:21:50,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:21:50,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:21:50,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:21:50,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:21:50,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:21:50,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:21:50,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:21:50,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:21:50,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:21:50,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:21:50,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:21:50,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:21:50,059 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:21:50,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:21:50,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:21:50,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:21:50,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:21:50,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:21:50,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:21:50,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:21:50,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:21:50,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:21:50,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:21:50,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:21:50,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:21:50,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:21:50,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:21:50,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:21:50,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:21:50,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:21:50,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:21:50,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:21:50,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:21:50,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:21:50,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:21:50,090 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:21:50,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:21:50,091 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:21:50,091 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:21:50,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:21:50,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:21:50,093 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:21:50,093 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:21:50,093 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:21:50,093 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:21:50,093 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:21:50,094 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:21:50,094 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:21:50,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:21:50,094 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:21:50,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:21:50,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:21:50,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:21:50,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:21:50,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:21:50,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:21:50,095 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:21:50,095 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:21:50,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:21:50,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:21:50,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:21:50,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:21:50,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:21:50,096 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:21:50,097 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 -> e028c51cfa02b345902e1292d1a644c7ee4a15183825ee6e2ec2fc316df147e6 [2022-07-13 03:21:50,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:21:50,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:21:50,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:21:50,302 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:21:50,302 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:21:50,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2022-07-13 03:21:50,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e812e2ef/c0fb38e0aad44cf695e2b046c4067100/FLAG82972ca5f [2022-07-13 03:21:50,803 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:21:50,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2022-07-13 03:21:50,818 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e812e2ef/c0fb38e0aad44cf695e2b046c4067100/FLAG82972ca5f [2022-07-13 03:21:50,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e812e2ef/c0fb38e0aad44cf695e2b046c4067100 [2022-07-13 03:21:50,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:21:50,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:21:50,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:21:50,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:21:50,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:21:50,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:21:50" (1/1) ... [2022-07-13 03:21:50,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342ab257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:21:50, skipping insertion in model container [2022-07-13 03:21:50,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:21:50" (1/1) ... [2022-07-13 03:21:50,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:21:50,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:21:51,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:21:51,158 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:21:51,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:21:51,208 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:21:51,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:21:51 WrapperNode [2022-07-13 03:21:51,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:21:51,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:21:51,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:21:51,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:21:51,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:21:51" (1/1) ... [2022-07-13 03:21:51,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:21:51" (1/1) ... [2022-07-13 03:21:51,244 INFO L137 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-07-13 03:21:51,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:21:51,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:21:51,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:21:51,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:21:51,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:21:51" (1/1) ... [2022-07-13 03:21:51,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:21:51" (1/1) ... [2022-07-13 03:21:51,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:21:51" (1/1) ... [2022-07-13 03:21:51,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:21:51" (1/1) ... [2022-07-13 03:21:51,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:21:51" (1/1) ... [2022-07-13 03:21:51,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:21:51" (1/1) ... [2022-07-13 03:21:51,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:21:51" (1/1) ... [2022-07-13 03:21:51,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:21:51,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:21:51,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:21:51,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:21:51,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:21:51" (1/1) ... [2022-07-13 03:21:51,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:51,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:51,294 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) [2022-07-13 03:21:51,296 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 [2022-07-13 03:21:51,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:21:51,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:21:51,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 03:21:51,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:21:51,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:21:51,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:21:51,415 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:21:51,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:21:51,594 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:21:51,597 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:21:51,598 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 03:21:51,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:21:51 BoogieIcfgContainer [2022-07-13 03:21:51,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:21:51,600 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:21:51,600 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:21:51,604 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:21:51,605 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:21:51,605 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:21:50" (1/3) ... [2022-07-13 03:21:51,606 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3813412d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:21:51, skipping insertion in model container [2022-07-13 03:21:51,606 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:21:51,606 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:21:51" (2/3) ... [2022-07-13 03:21:51,606 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3813412d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:21:51, skipping insertion in model container [2022-07-13 03:21:51,606 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:21:51,607 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:21:51" (3/3) ... [2022-07-13 03:21:51,607 INFO L354 chiAutomizerObserver]: Analyzing ICFG twisted-alloca.i [2022-07-13 03:21:51,647 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:21:51,648 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:21:51,648 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:21:51,648 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:21:51,648 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:21:51,648 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:21:51,648 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:21:51,649 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:21:51,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) 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) [2022-07-13 03:21:51,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:21:51,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:21:51,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:21:51,668 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:21:51,668 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 03:21:51,668 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:21:51,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) 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) [2022-07-13 03:21:51,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:21:51,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:21:51,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:21:51,671 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:21:51,671 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 03:21:51,675 INFO L752 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; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 2#L569true [2022-07-13 03:21:51,676 INFO L754 eck$LassoCheckResult]: Loop: 2#L569true assume !true; 12#L564true goto; 11#L567true call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 7#L564-1true assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 9#L566true assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 2#L569true [2022-07-13 03:21:51,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:51,680 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:21:51,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:51,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513075080] [2022-07-13 03:21:51,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:51,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:51,839 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:21:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:51,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:21:51,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:51,894 INFO L85 PathProgramCache]: Analyzing trace with hash 46885240, now seen corresponding path program 1 times [2022-07-13 03:21:51,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:51,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97199267] [2022-07-13 03:21:51,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:51,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:21:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:21:51,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:21:51,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97199267] [2022-07-13 03:21:51,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97199267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:21:51,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:21:51,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-13 03:21:51,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109239258] [2022-07-13 03:21:51,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:21:51,920 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:21:51,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:21:51,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 03:21:51,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 03:21:51,942 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.4285714285714286) 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 1 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:21:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:21:51,946 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-07-13 03:21:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 03:21:51,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2022-07-13 03:21:51,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:21:51,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2022-07-13 03:21:51,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-13 03:21:51,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-13 03:21:51,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2022-07-13 03:21:51,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:21:51,956 INFO L369 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-13 03:21:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2022-07-13 03:21:51,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-13 03:21:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:21:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-07-13 03:21:51,971 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-13 03:21:51,971 INFO L374 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-13 03:21:51,971 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:21:51,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2022-07-13 03:21:51,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:21:51,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:21:51,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:21:51,973 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:21:51,974 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:21:51,974 INFO L752 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 41#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 38#L569 [2022-07-13 03:21:51,974 INFO L754 eck$LassoCheckResult]: Loop: 38#L569 goto; 39#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 44#L557-1 assume !(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1; 43#L564 goto; 45#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 46#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 47#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 38#L569 [2022-07-13 03:21:51,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:51,975 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-13 03:21:51,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:51,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898215913] [2022-07-13 03:21:51,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:51,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:52,055 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:21:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:52,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:21:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1311753714, now seen corresponding path program 1 times [2022-07-13 03:21:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:52,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340638314] [2022-07-13 03:21:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:52,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:52,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:21:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:52,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:21:52,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash 234543116, now seen corresponding path program 1 times [2022-07-13 03:21:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:52,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84987631] [2022-07-13 03:21:52,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:52,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:52,180 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:21:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:52,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:21:53,676 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:21:53,677 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:21:53,677 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:21:53,677 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:21:53,678 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:21:53,678 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:53,678 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:21:53,678 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:21:53,678 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration2_Lasso [2022-07-13 03:21:53,678 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:21:53,678 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:21:53,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:53,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:53,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:53,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:53,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:53,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:53,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:53,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:54,743 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:21:54,745 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:21:54,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:54,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:54,748 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) [2022-07-13 03:21:54,748 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 [2022-07-13 03:21:54,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:54,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:54,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:21:54,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:54,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:54,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:54,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:21:54,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:21:54,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:54,785 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 [2022-07-13 03:21:54,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:54,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:54,787 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) [2022-07-13 03:21:54,788 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 [2022-07-13 03:21:54,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:54,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:54,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:21:54,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:54,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:54,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:54,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:21:54,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:21:54,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:54,812 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 [2022-07-13 03:21:54,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:54,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:54,813 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) [2022-07-13 03:21:54,814 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 [2022-07-13 03:21:54,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:54,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:54,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:54,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:54,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:54,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:54,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:54,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:54,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-13 03:21:54,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:54,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:54,851 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) [2022-07-13 03:21:54,852 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 [2022-07-13 03:21:54,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:54,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:54,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:54,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:54,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:54,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:54,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:54,885 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:54,900 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 [2022-07-13 03:21:54,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:54,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:54,902 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) [2022-07-13 03:21:54,903 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 [2022-07-13 03:21:54,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:54,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:54,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:54,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:54,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:54,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:54,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:54,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:54,948 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 [2022-07-13 03:21:54,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:54,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:54,949 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) [2022-07-13 03:21:54,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:54,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:54,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:21:54,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:54,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:54,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:54,963 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 [2022-07-13 03:21:54,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:21:54,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:21:54,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:54,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-13 03:21:54,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:54,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:54,986 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) [2022-07-13 03:21:54,987 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 [2022-07-13 03:21:54,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:54,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:54,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:21:54,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:54,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:54,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:54,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:21:54,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:21:54,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:55,014 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 [2022-07-13 03:21:55,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:55,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:55,016 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) [2022-07-13 03:21:55,016 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 [2022-07-13 03:21:55,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:55,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:55,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:55,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:55,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:55,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:55,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:55,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:55,061 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 [2022-07-13 03:21:55,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:55,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:55,063 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) [2022-07-13 03:21:55,063 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 [2022-07-13 03:21:55,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:55,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:55,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:55,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:55,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:55,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:55,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:55,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:55,126 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 [2022-07-13 03:21:55,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:55,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:55,128 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) [2022-07-13 03:21:55,129 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 [2022-07-13 03:21:55,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:55,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:55,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:55,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:55,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:55,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:55,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:55,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:55,172 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 [2022-07-13 03:21:55,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:55,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:55,173 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) [2022-07-13 03:21:55,174 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 [2022-07-13 03:21:55,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:55,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:55,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:55,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:55,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:55,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:55,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:55,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:55,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-13 03:21:55,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:55,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:55,222 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) [2022-07-13 03:21:55,223 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 [2022-07-13 03:21:55,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:55,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:55,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:55,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:55,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:55,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:55,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:55,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:55,256 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 [2022-07-13 03:21:55,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:55,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:55,258 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) [2022-07-13 03:21:55,259 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 [2022-07-13 03:21:55,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:55,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:55,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:55,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:55,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:55,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:55,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:55,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:55,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-13 03:21:55,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:55,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:55,318 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) [2022-07-13 03:21:55,319 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 [2022-07-13 03:21:55,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 [2022-07-13 03:21:55,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:55,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:55,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:55,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:55,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:55,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:55,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:55,370 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 [2022-07-13 03:21:55,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:55,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:55,372 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) [2022-07-13 03:21:55,376 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 [2022-07-13 03:21:55,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:55,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:55,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:55,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:55,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:55,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:55,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:55,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:55,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-13 03:21:55,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:55,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:55,460 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) [2022-07-13 03:21:55,461 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 [2022-07-13 03:21:55,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 [2022-07-13 03:21:55,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:55,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:55,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:55,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:55,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:55,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:55,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:55,516 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 [2022-07-13 03:21:55,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:55,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:55,532 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) [2022-07-13 03:21:55,533 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 [2022-07-13 03:21:55,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:55,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:55,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:55,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:55,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:55,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:55,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:55,559 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:21:55,579 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-13 03:21:55,579 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-07-13 03:21:55,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:55,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:55,584 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) [2022-07-13 03:21:55,585 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 [2022-07-13 03:21:55,607 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:21:55,644 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:21:55,645 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:21:55,645 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~j~0#1.base) ULTIMATE.start_f_~j~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_f_~j~0#1.base) ULTIMATE.start_f_~j~0#1.offset)_1 + 1 Supporting invariants [] [2022-07-13 03:21:55,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-13 03:21:55,785 INFO L293 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2022-07-13 03:21:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:21:55,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:21:55,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:21:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:21:55,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:21:55,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:21:55,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-07-13 03:21:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:21:55,925 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-13 03:21:55,926 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:21:55,953 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 20 states and 27 transitions. Complement of second has 6 states. [2022-07-13 03:21:55,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 03:21:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:21:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-07-13 03:21:55,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 7 letters. [2022-07-13 03:21:55,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:21:55,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 7 letters. [2022-07-13 03:21:55,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:21:55,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 14 letters. [2022-07-13 03:21:55,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:21:55,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2022-07-13 03:21:55,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:21:55,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 21 transitions. [2022-07-13 03:21:55,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-13 03:21:55,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-13 03:21:55,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2022-07-13 03:21:55,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:21:55,960 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-07-13 03:21:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2022-07-13 03:21:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-07-13 03:21:55,961 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) [2022-07-13 03:21:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2022-07-13 03:21:55,961 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-07-13 03:21:55,961 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-07-13 03:21:55,961 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:21:55,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2022-07-13 03:21:55,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:21:55,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:21:55,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:21:55,962 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:21:55,962 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:21:55,962 INFO L752 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 288#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 297#L569 goto; 284#L560 [2022-07-13 03:21:55,963 INFO L754 eck$LassoCheckResult]: Loop: 284#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 292#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 289#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 284#L560 [2022-07-13 03:21:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2022-07-13 03:21:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:55,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452260070] [2022-07-13 03:21:55,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:55,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:55,997 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:21:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:56,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:21:56,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:56,010 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2022-07-13 03:21:56,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:56,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591349982] [2022-07-13 03:21:56,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:56,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:56,016 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:21:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:56,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:21:56,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:56,021 INFO L85 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2022-07-13 03:21:56,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:56,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033008516] [2022-07-13 03:21:56,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:56,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:56,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-13 03:21:56,060 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:21:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:56,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:21:56,972 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:21:56,973 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:21:56,973 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:21:56,973 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:21:56,973 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:21:56,973 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:56,973 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:21:56,973 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:21:56,973 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration3_Lasso [2022-07-13 03:21:56,973 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:21:56,973 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:21:56,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:56,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:56,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:56,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:56,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:56,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:56,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:21:57,811 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:21:57,811 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:21:57,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:57,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:57,816 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) [2022-07-13 03:21:57,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 [2022-07-13 03:21:57,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:57,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:21:57,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:57,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:57,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:57,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:21:57,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:21:57,839 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 [2022-07-13 03:21:57,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:57,863 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 [2022-07-13 03:21:57,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:57,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:57,865 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) [2022-07-13 03:21:57,867 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 [2022-07-13 03:21:57,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:57,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:57,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:21:57,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:57,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:57,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:57,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:21:57,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:21:57,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:57,890 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 [2022-07-13 03:21:57,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:57,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:57,891 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) [2022-07-13 03:21:57,892 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 [2022-07-13 03:21:57,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 [2022-07-13 03:21:57,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:57,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:57,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:57,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:57,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:57,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:57,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:57,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-13 03:21:57,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:57,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:57,929 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) [2022-07-13 03:21:57,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:57,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:57,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:57,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:57,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:57,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:57,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:57,947 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 [2022-07-13 03:21:57,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:57,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-13 03:21:57,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:57,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:57,974 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) [2022-07-13 03:21:57,975 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 [2022-07-13 03:21:57,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:57,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:57,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:21:57,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:57,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:57,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:57,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:21:57,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:21:57,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:57,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-13 03:21:58,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:58,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:58,001 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) [2022-07-13 03:21:58,004 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 [2022-07-13 03:21:58,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:58,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:58,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:21:58,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:58,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:58,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:58,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:21:58,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:21:58,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:58,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-13 03:21:58,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:58,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:58,029 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) [2022-07-13 03:21:58,030 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 [2022-07-13 03:21:58,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:58,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:58,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:58,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:58,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:58,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:58,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:58,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:58,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-13 03:21:58,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:58,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:58,074 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) [2022-07-13 03:21:58,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:58,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:58,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:58,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:58,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:58,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:58,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:58,117 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 [2022-07-13 03:21:58,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:58,137 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 [2022-07-13 03:21:58,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:58,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:58,139 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) [2022-07-13 03:21:58,140 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 [2022-07-13 03:21:58,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 [2022-07-13 03:21:58,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:58,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:58,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:58,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:58,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:58,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:58,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:58,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-13 03:21:58,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:58,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:58,180 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) [2022-07-13 03:21:58,181 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 [2022-07-13 03:21:58,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:58,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:58,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:58,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:58,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:58,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:58,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:58,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:58,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-13 03:21:58,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:58,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:58,215 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) [2022-07-13 03:21:58,216 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 [2022-07-13 03:21:58,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 [2022-07-13 03:21:58,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:58,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:58,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:58,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:58,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:58,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:58,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:58,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-13 03:21:58,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:58,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:58,257 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) [2022-07-13 03:21:58,258 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 [2022-07-13 03:21:58,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:58,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:58,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:58,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:58,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:58,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:58,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:58,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:58,314 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 [2022-07-13 03:21:58,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:58,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:58,315 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) [2022-07-13 03:21:58,316 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 [2022-07-13 03:21:58,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:58,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:58,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:58,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:58,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:58,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:58,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:58,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:58,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-13 03:21:58,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:58,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:58,345 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) [2022-07-13 03:21:58,346 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 [2022-07-13 03:21:58,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 [2022-07-13 03:21:58,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:58,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:58,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:58,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:58,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:58,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:58,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:21:58,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-13 03:21:58,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:58,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:58,385 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) [2022-07-13 03:21:58,386 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 [2022-07-13 03:21:58,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:21:58,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:21:58,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:21:58,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:21:58,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:21:58,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:21:58,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:21:58,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:21:58,430 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-13 03:21:58,430 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-13 03:21:58,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:21:58,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:58,432 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:21:58,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-13 03:21:58,433 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:21:58,440 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-13 03:21:58,440 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:21:58,440 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~i~0#1.base) ULTIMATE.start_f_~i~0#1.offset)_2, ULTIMATE.start_f_~k#1) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0#1.base) ULTIMATE.start_f_~i~0#1.offset)_2 + 1*ULTIMATE.start_f_~k#1 Supporting invariants [1*ULTIMATE.start_f_~k#1 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0#1.base) ULTIMATE.start_f_~k_ref~0#1.offset)_2 >= 0] [2022-07-13 03:21:58,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-13 03:21:58,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-13 03:21:58,574 INFO L293 tatePredicateManager]: 36 out of 37 supporting invariants were superfluous and have been removed [2022-07-13 03:21:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:21:58,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-13 03:21:58,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:21:58,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-07-13 03:21:58,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:21:58,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:21:58,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:21:58,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:21:58,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:21:58,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:21:58,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2022-07-13 03:21:58,680 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 03:21:58,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2022-07-13 03:21:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:21:58,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 03:21:58,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:21:58,739 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-07-13 03:21:58,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 40 [2022-07-13 03:21:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:21:58,761 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-07-13 03:21:58,761 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) [2022-07-13 03:21:58,790 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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 34 states and 43 transitions. Complement of second has 8 states. [2022-07-13 03:21:58,791 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 [2022-07-13 03:21:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) [2022-07-13 03:21:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2022-07-13 03:21:58,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2022-07-13 03:21:58,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:21:58,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2022-07-13 03:21:58,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:21:58,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2022-07-13 03:21:58,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:21:58,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2022-07-13 03:21:58,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:21:58,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 31 transitions. [2022-07-13 03:21:58,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-13 03:21:58,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-13 03:21:58,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2022-07-13 03:21:58,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:21:58,799 INFO L369 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-07-13 03:21:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2022-07-13 03:21:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-07-13 03:21:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:21:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2022-07-13 03:21:58,804 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-07-13 03:21:58,804 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-07-13 03:21:58,804 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:21:58,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-07-13 03:21:58,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:21:58,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:21:58,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:21:58,808 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:21:58,808 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:21:58,809 INFO L752 eck$LassoCheckResult]: Stem: 535#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 536#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 531#L569 goto; 532#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 548#L557-1 assume !(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1; 540#L564 goto; 545#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 546#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 547#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 549#L569 goto; 538#L560 [2022-07-13 03:21:58,809 INFO L754 eck$LassoCheckResult]: Loop: 538#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 543#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 537#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 538#L560 [2022-07-13 03:21:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:58,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1319097990, now seen corresponding path program 2 times [2022-07-13 03:21:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:58,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165643844] [2022-07-13 03:21:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:58,863 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:21:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:58,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:21:58,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:58,891 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2022-07-13 03:21:58,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:58,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978186995] [2022-07-13 03:21:58,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:58,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:58,903 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:21:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:58,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:21:58,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:58,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1702545424, now seen corresponding path program 1 times [2022-07-13 03:21:58,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:58,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061311004] [2022-07-13 03:21:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:58,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:21:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:21:59,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:21:59,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061311004] [2022-07-13 03:21:59,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061311004] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:21:59,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641864905] [2022-07-13 03:21:59,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:59,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:21:59,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:21:59,033 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:21:59,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-07-13 03:21:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:21:59,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 03:21:59,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:21:59,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-07-13 03:21:59,164 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 03:21:59,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2022-07-13 03:21:59,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:21:59,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2022-07-13 03:21:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:21:59,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:21:59,261 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-13 03:21:59,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 53 [2022-07-13 03:21:59,266 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:21:59,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-07-13 03:21:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:21:59,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641864905] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:21:59,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:21:59,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-07-13 03:21:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533201107] [2022-07-13 03:21:59,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:21:59,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:21:59,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 03:21:59,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=134, Unknown=2, NotChecked=0, Total=182 [2022-07-13 03:21:59,336 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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) [2022-07-13 03:21:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:21:59,416 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-07-13 03:21:59,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 03:21:59,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2022-07-13 03:21:59,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:21:59,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 20 states and 24 transitions. [2022-07-13 03:21:59,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-13 03:21:59,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-13 03:21:59,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2022-07-13 03:21:59,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:21:59,417 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-13 03:21:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2022-07-13 03:21:59,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2022-07-13 03:21:59,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:21:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-07-13 03:21:59,419 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-07-13 03:21:59,419 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-07-13 03:21:59,419 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:21:59,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2022-07-13 03:21:59,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:21:59,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:21:59,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:21:59,419 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:21:59,419 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:21:59,419 INFO L752 eck$LassoCheckResult]: Stem: 694#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 695#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 691#L569 goto; 692#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 701#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 698#L559 assume !(0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2));havoc f_#t~mem10#1; 699#L564 goto; 702#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 703#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 704#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 705#L569 goto; 697#L560 [2022-07-13 03:21:59,419 INFO L754 eck$LassoCheckResult]: Loop: 697#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 700#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 696#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 697#L560 [2022-07-13 03:21:59,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:59,420 INFO L85 PathProgramCache]: Analyzing trace with hash -635175977, now seen corresponding path program 1 times [2022-07-13 03:21:59,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:59,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439269589] [2022-07-13 03:21:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:59,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:21:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:21:59,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:21:59,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439269589] [2022-07-13 03:21:59,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439269589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:21:59,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:21:59,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 03:21:59,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809757740] [2022-07-13 03:21:59,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:21:59,494 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:21:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2022-07-13 03:21:59,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:59,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795423159] [2022-07-13 03:21:59,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:59,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:59,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:21:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:59,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:21:59,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:21:59,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 03:21:59,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 03:21:59,554 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) [2022-07-13 03:21:59,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:21:59,582 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-07-13 03:21:59,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 03:21:59,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2022-07-13 03:21:59,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:21:59,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 23 transitions. [2022-07-13 03:21:59,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-13 03:21:59,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-13 03:21:59,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2022-07-13 03:21:59,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:21:59,584 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-13 03:21:59,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2022-07-13 03:21:59,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-13 03:21:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:21:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-13 03:21:59,585 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-13 03:21:59,585 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-13 03:21:59,585 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:21:59,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2022-07-13 03:21:59,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:21:59,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:21:59,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:21:59,585 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:21:59,585 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:21:59,586 INFO L752 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 745#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 740#L569 goto; 741#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 755#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 748#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 743#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 750#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 757#L559 assume !(0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2));havoc f_#t~mem10#1; 754#L564 goto; 751#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 752#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 753#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 756#L569 goto; 747#L560 [2022-07-13 03:21:59,586 INFO L754 eck$LassoCheckResult]: Loop: 747#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 749#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 746#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 747#L560 [2022-07-13 03:21:59,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:59,586 INFO L85 PathProgramCache]: Analyzing trace with hash 184869755, now seen corresponding path program 1 times [2022-07-13 03:21:59,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:59,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288024812] [2022-07-13 03:21:59,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:59,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:59,633 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:21:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:59,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:21:59,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:59,651 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2022-07-13 03:21:59,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:59,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123806167] [2022-07-13 03:21:59,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:59,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:59,656 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:21:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:59,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:21:59,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:21:59,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1306804847, now seen corresponding path program 2 times [2022-07-13 03:21:59,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:21:59,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074764750] [2022-07-13 03:21:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:21:59,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:21:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:59,694 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:21:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:21:59,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:22:01,555 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:22:01,555 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:22:01,556 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:22:01,556 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:22:01,556 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:22:01,556 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:22:01,556 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:22:01,556 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:22:01,556 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration6_Lasso [2022-07-13 03:22:01,556 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:22:01,556 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:22:01,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:01,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:01,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:22:02,534 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:22:02,534 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:22:02,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:22:02,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:22:02,535 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) [2022-07-13 03:22:02,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:22:02,548 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 [2022-07-13 03:22:02,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:22:02,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:22:02,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:22:02,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:22:02,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:22:02,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:22:02,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:22:02,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:22:02,564 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 [2022-07-13 03:22:02,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:22:02,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:22:02,565 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) [2022-07-13 03:22:02,566 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 [2022-07-13 03:22:02,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:22:02,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:22:02,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:22:02,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:22:02,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:22:02,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:22:02,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:22:02,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:22:02,600 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 [2022-07-13 03:22:02,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:22:02,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:22:02,602 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) [2022-07-13 03:22:02,602 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 [2022-07-13 03:22:02,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:22:02,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:22:02,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:22:02,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:22:02,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:22:02,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:22:02,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:22:02,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:22:02,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-13 03:22:02,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:22:02,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:22:02,629 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) [2022-07-13 03:22:02,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:22:02,634 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 [2022-07-13 03:22:02,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:22:02,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:22:02,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:22:02,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:22:02,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:22:02,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:22:02,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:22:02,658 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 [2022-07-13 03:22:02,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:22:02,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:22:02,659 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) [2022-07-13 03:22:02,660 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 [2022-07-13 03:22:02,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:22:02,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:22:02,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:22:02,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:22:02,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:22:02,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:22:02,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:22:02,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:22:02,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-13 03:22:02,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:22:02,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:22:02,691 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) [2022-07-13 03:22:02,692 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 [2022-07-13 03:22:02,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:22:02,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:22:02,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:22:02,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:22:02,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:22:02,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:22:02,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:22:02,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:22:02,743 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 [2022-07-13 03:22:02,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:22:02,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:22:02,745 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) [2022-07-13 03:22:02,751 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 [2022-07-13 03:22:02,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:22:02,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:22:02,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:22:02,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:22:02,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:22:02,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:22:02,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:22:02,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:22:02,786 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 [2022-07-13 03:22:02,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:22:02,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:22:02,787 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) [2022-07-13 03:22:02,790 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 [2022-07-13 03:22:02,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:22:02,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:22:02,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:22:02,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:22:02,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:22:02,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:22:02,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:22:02,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:22:02,849 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 [2022-07-13 03:22:02,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:22:02,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:22:02,851 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) [2022-07-13 03:22:02,852 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 [2022-07-13 03:22:02,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 [2022-07-13 03:22:02,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:22:02,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:22:02,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:22:02,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:22:02,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:22:02,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:22:02,870 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:22:02,885 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 [2022-07-13 03:22:02,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:22:02,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:22:02,886 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) [2022-07-13 03:22:02,889 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 [2022-07-13 03:22:02,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:22:02,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:22:02,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:22:02,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:22:02,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:22:02,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:22:02,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:22:02,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:22:02,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-13 03:22:02,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:22:02,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:22:02,915 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) [2022-07-13 03:22:02,916 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 [2022-07-13 03:22:02,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:22:02,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:22:02,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:22:02,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:22:02,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:22:02,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:22:02,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:22:02,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:22:02,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-13 03:22:02,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:22:02,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:22:02,952 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) [2022-07-13 03:22:02,953 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 [2022-07-13 03:22:02,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:22:02,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:22:02,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:22:02,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:22:02,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:22:02,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:22:02,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:22:02,969 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:22:02,980 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-13 03:22:02,980 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-13 03:22:02,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:22:02,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:22:02,981 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) [2022-07-13 03:22:02,982 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 [2022-07-13 03:22:02,982 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:22:02,992 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:22:02,992 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:22:02,992 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~i~0#1.base) ULTIMATE.start_f_~i~0#1.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0#1.base) ULTIMATE.start_f_~k_ref~0#1.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0#1.base) ULTIMATE.start_f_~i~0#1.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0#1.base) ULTIMATE.start_f_~k_ref~0#1.offset)_3 Supporting invariants [] [2022-07-13 03:22:03,007 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 [2022-07-13 03:22:03,096 INFO L293 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2022-07-13 03:22:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:22:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:22:03,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:22:03,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:22:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:22:03,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 03:22:03,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:22:03,203 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-07-13 03:22:03,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 37 [2022-07-13 03:22:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:22:03,221 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-13 03:22:03,221 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2022-07-13 03:22:03,233 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 30 states and 35 transitions. Complement of second has 7 states. [2022-07-13 03:22:03,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 03:22:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2022-07-13 03:22:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-07-13 03:22:03,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2022-07-13 03:22:03,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:22:03,235 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:22:03,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:22:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:22:03,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:22:03,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:22:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:22:03,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 03:22:03,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:22:03,315 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-07-13 03:22:03,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 37 [2022-07-13 03:22:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:22:03,331 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-13 03:22:03,332 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2022-07-13 03:22:03,353 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 51 states and 59 transitions. Complement of second has 9 states. [2022-07-13 03:22:03,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-13 03:22:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2022-07-13 03:22:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-07-13 03:22:03,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2022-07-13 03:22:03,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:22:03,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 17 letters. Loop has 3 letters. [2022-07-13 03:22:03,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:22:03,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2022-07-13 03:22:03,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:22:03,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2022-07-13 03:22:03,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:22:03,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 37 states and 43 transitions. [2022-07-13 03:22:03,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-13 03:22:03,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-13 03:22:03,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2022-07-13 03:22:03,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:22:03,356 INFO L369 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-07-13 03:22:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2022-07-13 03:22:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-07-13 03:22:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 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) [2022-07-13 03:22:03,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-07-13 03:22:03,357 INFO L392 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-13 03:22:03,357 INFO L374 stractBuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-13 03:22:03,357 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:22:03,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2022-07-13 03:22:03,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:22:03,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:22:03,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:22:03,358 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:22:03,358 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:22:03,358 INFO L752 eck$LassoCheckResult]: Stem: 1127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1128#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 1123#L569 goto; 1124#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 1136#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1131#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 1132#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 1154#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1153#L559 assume !(0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2));havoc f_#t~mem10#1; 1152#L564 goto; 1150#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 1137#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1138#L566 assume 0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2);havoc f_#t~mem14#1; 1144#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 1146#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1143#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 1142#L569 goto; 1130#L560 [2022-07-13 03:22:03,358 INFO L754 eck$LassoCheckResult]: Loop: 1130#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 1135#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1129#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 1130#L560 [2022-07-13 03:22:03,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:22:03,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1305515858, now seen corresponding path program 1 times [2022-07-13 03:22:03,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:22:03,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443743564] [2022-07-13 03:22:03,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:22:03,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:22:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:22:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 03:22:03,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:22:03,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443743564] [2022-07-13 03:22:03,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443743564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:22:03,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271742799] [2022-07-13 03:22:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:22:03,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:22:03,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:22:03,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-13 03:22:03,436 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:22:03,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-07-13 03:22:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:22:03,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 03:22:03,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:22:03,795 INFO L356 Elim1Store]: treesize reduction 324, result has 30.9 percent of original size [2022-07-13 03:22:03,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 442 treesize of output 633 [2022-07-13 03:22:03,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 03:22:03,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 03:22:03,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 03:22:03,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 03:22:06,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 03:22:06,282 INFO L356 Elim1Store]: treesize reduction 184, result has 21.0 percent of original size [2022-07-13 03:22:06,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 1802 treesize of output 2298 [2022-07-13 03:22:06,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:22:06,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:22:06,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:22:06,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 03:22:07,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:22:07,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:22:07,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:22:07,067 INFO L356 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2022-07-13 03:22:07,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 1086 treesize of output 698 [2022-07-13 03:22:07,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-07-13 03:22:07,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-13 03:22:07,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 03:22:07,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 03:22:07,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 03:22:07,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:22:07,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:22:07,306 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-13 03:22:07,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 173 [2022-07-13 03:22:07,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-13 03:22:07,318 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:22:07,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 03:22:07,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 03:22:07,994 INFO L356 Elim1Store]: treesize reduction 415, result has 23.9 percent of original size [2022-07-13 03:22:07,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 26 case distinctions, treesize of input 9644 treesize of output 9963 [2022-07-13 03:22:09,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:22:09,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:22:09,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:22:09,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:22:09,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:22:09,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:22:09,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:22:11,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 03:22:11,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 03:22:11,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 03:22:12,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 03:22:12,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 03:22:12,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11