./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 970cab0a23b690f163a0a51afef8881644c6447187bc11bbe1f60a2a40cf01a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:39:22,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:39:22,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:39:22,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:39:22,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:39:22,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:39:22,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:39:22,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:39:22,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:39:22,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:39:22,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:39:22,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:39:22,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:39:22,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:39:22,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:39:22,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:39:22,234 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:39:22,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:39:22,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:39:22,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:39:22,241 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:39:22,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:39:22,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:39:22,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:39:22,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:39:22,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:39:22,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:39:22,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:39:22,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:39:22,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:39:22,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:39:22,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:39:22,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:39:22,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:39:22,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:39:22,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:39:22,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:39:22,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:39:22,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:39:22,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:39:22,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:39:22,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:39:22,264 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 15:39:22,286 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:39:22,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:39:22,287 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:39:22,287 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:39:22,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:39:22,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:39:22,288 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:39:22,289 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:39:22,289 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:39:22,289 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:39:22,290 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:39:22,290 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:39:22,290 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:39:22,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:39:22,290 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 15:39:22,290 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:39:22,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:39:22,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 15:39:22,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:39:22,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:39:22,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:39:22,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:39:22,292 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 15:39:22,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:39:22,292 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:39:22,292 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:39:22,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:39:22,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:39:22,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:39:22,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:39:22,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:39:22,294 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:39:22,294 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 970cab0a23b690f163a0a51afef8881644c6447187bc11bbe1f60a2a40cf01a7 [2022-07-14 15:39:22,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:39:22,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:39:22,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:39:22,502 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:39:22,509 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:39:22,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2022-07-14 15:39:22,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b63bbbd2/1af8022ba3e942118ea0066f1e93b22e/FLAGf5465cd3a [2022-07-14 15:39:22,879 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:39:22,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2022-07-14 15:39:22,888 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b63bbbd2/1af8022ba3e942118ea0066f1e93b22e/FLAGf5465cd3a [2022-07-14 15:39:23,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b63bbbd2/1af8022ba3e942118ea0066f1e93b22e [2022-07-14 15:39:23,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:39:23,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:39:23,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:39:23,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:39:23,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:39:23,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:39:23" (1/1) ... [2022-07-14 15:39:23,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e517ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:39:23, skipping insertion in model container [2022-07-14 15:39:23,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:39:23" (1/1) ... [2022-07-14 15:39:23,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:39:23,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:39:23,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i[878,891] [2022-07-14 15:39:23,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:39:23,483 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:39:23,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i[878,891] [2022-07-14 15:39:23,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:39:23,522 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:39:23,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:39:23 WrapperNode [2022-07-14 15:39:23,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:39:23,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:39:23,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:39:23,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:39:23,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:39:23" (1/1) ... [2022-07-14 15:39:23,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:39:23" (1/1) ... [2022-07-14 15:39:23,559 INFO L137 Inliner]: procedures = 42, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-07-14 15:39:23,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:39:23,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:39:23,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:39:23,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:39:23,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:39:23" (1/1) ... [2022-07-14 15:39:23,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:39:23" (1/1) ... [2022-07-14 15:39:23,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:39:23" (1/1) ... [2022-07-14 15:39:23,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:39:23" (1/1) ... [2022-07-14 15:39:23,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:39:23" (1/1) ... [2022-07-14 15:39:23,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:39:23" (1/1) ... [2022-07-14 15:39:23,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:39:23" (1/1) ... [2022-07-14 15:39:23,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:39:23,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:39:23,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:39:23,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:39:23,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:39:23" (1/1) ... [2022-07-14 15:39:23,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:23,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:23,624 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-14 15:39:23,629 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-14 15:39:23,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 15:39:23,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 15:39:23,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:39:23,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:39:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 15:39:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-07-14 15:39:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:39:23,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:39:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:39:23,701 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:39:23,703 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:39:23,891 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:39:23,895 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:39:23,896 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-14 15:39:23,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:39:23 BoogieIcfgContainer [2022-07-14 15:39:23,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:39:23,898 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:39:23,898 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:39:23,900 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:39:23,900 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:39:23,900 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:39:23" (1/3) ... [2022-07-14 15:39:23,901 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cf882b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:39:23, skipping insertion in model container [2022-07-14 15:39:23,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:39:23,902 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:39:23" (2/3) ... [2022-07-14 15:39:23,902 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cf882b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:39:23, skipping insertion in model container [2022-07-14 15:39:23,902 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:39:23,902 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:39:23" (3/3) ... [2022-07-14 15:39:23,903 INFO L354 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2022-07-14 15:39:23,935 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:39:23,935 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:39:23,935 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:39:23,935 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:39:23,936 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:39:23,936 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:39:23,936 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:39:23,936 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:39:23,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 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-14 15:39:23,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-14 15:39:23,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:23,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:23,962 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:39:23,962 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:39:23,962 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:39:23,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 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-14 15:39:23,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-14 15:39:23,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:23,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:23,968 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:39:23,968 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:39:23,972 INFO L752 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 36#L90-3true [2022-07-14 15:39:23,973 INFO L754 eck$LassoCheckResult]: Loop: 36#L90-3true assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 33#L90-2true main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 36#L90-3true [2022-07-14 15:39:23,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:23,980 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 15:39:23,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:23,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195623911] [2022-07-14 15:39:23,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:23,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:24,063 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:24,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:24,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-14 15:39:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:24,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262401445] [2022-07-14 15:39:24,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:24,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:24,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:24,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:24,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:24,138 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-14 15:39:24,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:24,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365762637] [2022-07-14 15:39:24,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:24,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:24,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:24,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:24,424 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:39:24,425 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:39:24,425 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:39:24,425 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:39:24,425 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:39:24,425 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:24,426 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:39:24,426 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:39:24,426 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2022-07-14 15:39:24,426 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:39:24,426 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:39:24,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-14 15:39:24,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-14 15:39:24,581 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-14 15:39:24,583 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-14 15:39:24,585 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-14 15:39:24,586 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-14 15:39:24,762 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:39:24,764 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:39:24,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:24,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:24,767 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-14 15:39:24,768 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-14 15:39:24,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:24,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:24,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:24,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:24,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:24,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:24,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:24,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:24,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:24,811 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-14 15:39:24,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:24,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:24,813 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-14 15:39:24,814 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-14 15:39:24,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-14 15:39:24,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:24,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:24,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:24,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:24,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:24,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:24,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:24,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-14 15:39:24,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:24,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:24,847 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-14 15:39:24,848 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-14 15:39:24,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:24,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:24,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:24,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:24,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:24,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:24,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:24,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:24,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:24,878 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-14 15:39:24,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:24,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:24,879 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-14 15:39:24,880 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-14 15:39:24,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:24,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:24,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:24,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:24,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:24,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:24,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:24,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:24,922 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-14 15:39:24,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:24,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:24,924 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-14 15:39:24,925 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-14 15:39:24,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:24,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:24,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:24,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:24,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:24,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:24,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:24,949 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:39:24,978 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-14 15:39:24,978 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-14 15:39:24,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:24,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:24,995 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-14 15:39:25,074 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-14 15:39:25,074 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:39:25,091 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:39:25,091 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:39:25,091 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 15*v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1 - 2*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2022-07-14 15:39:25,113 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-14 15:39:25,126 INFO L293 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2022-07-14 15:39:25,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:25,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:39:25,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:39:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:25,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:39:25,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:39:25,203 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-14 15:39:25,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:25,222 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:39:25,223 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-14 15:39:25,298 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 102 states and 153 transitions. Complement of second has 8 states. [2022-07-14 15:39:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:39:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-14 15:39:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-07-14 15:39:25,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-14 15:39:25,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:39:25,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-14 15:39:25,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:39:25,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-14 15:39:25,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:39:25,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 153 transitions. [2022-07-14 15:39:25,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-14 15:39:25,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 32 states and 43 transitions. [2022-07-14 15:39:25,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-14 15:39:25,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-14 15:39:25,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2022-07-14 15:39:25,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:39:25,320 INFO L369 hiAutomatonCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-07-14 15:39:25,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2022-07-14 15:39:25,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-14 15:39:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:39:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-07-14 15:39:25,339 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-07-14 15:39:25,339 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-07-14 15:39:25,339 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:39:25,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2022-07-14 15:39:25,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-14 15:39:25,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:25,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:25,342 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-14 15:39:25,342 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:39:25,342 INFO L752 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 204#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 205#L90-3 assume !(main_~i~1#1 < 8); 213#L90-4 call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 214#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 210#L63-4 [2022-07-14 15:39:25,342 INFO L754 eck$LassoCheckResult]: Loop: 210#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 195#L66 assume !parse_expression_list_#t~switch5#1; 196#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 211#L63-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 212#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 210#L63-4 [2022-07-14 15:39:25,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:25,343 INFO L85 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2022-07-14 15:39:25,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:25,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346103105] [2022-07-14 15:39:25,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:25,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:25,373 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-14 15:39:25,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:39:25,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346103105] [2022-07-14 15:39:25,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346103105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:39:25,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:39:25,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:39:25,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642829276] [2022-07-14 15:39:25,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:39:25,376 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:39:25,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:25,376 INFO L85 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 1 times [2022-07-14 15:39:25,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:25,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239255629] [2022-07-14 15:39:25,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:25,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:25,381 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:25,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:25,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:39:25,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:39:25,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:39:25,435 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-14 15:39:25,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:39:25,443 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-07-14 15:39:25,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:39:25,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2022-07-14 15:39:25,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-14 15:39:25,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2022-07-14 15:39:25,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-14 15:39:25,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-14 15:39:25,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2022-07-14 15:39:25,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:39:25,446 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-07-14 15:39:25,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2022-07-14 15:39:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-07-14 15:39:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 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-14 15:39:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-07-14 15:39:25,447 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-07-14 15:39:25,447 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-07-14 15:39:25,447 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:39:25,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2022-07-14 15:39:25,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-14 15:39:25,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:25,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:25,448 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:39:25,448 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:39:25,448 INFO L752 eck$LassoCheckResult]: Stem: 291#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 276#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 296#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 297#L90-3 assume !(main_~i~1#1 < 8); 286#L90-4 call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 287#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 281#L63-4 [2022-07-14 15:39:25,448 INFO L754 eck$LassoCheckResult]: Loop: 281#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 266#L66 assume !parse_expression_list_#t~switch5#1; 267#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 282#L63-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 283#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 281#L63-4 [2022-07-14 15:39:25,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:25,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669544, now seen corresponding path program 1 times [2022-07-14 15:39:25,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:25,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088026921] [2022-07-14 15:39:25,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:25,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:39:25,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:39:25,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088026921] [2022-07-14 15:39:25,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088026921] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:39:25,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834278445] [2022-07-14 15:39:25,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:25,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:39:25,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:25,476 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:39:25,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 15:39:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:25,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 15:39:25,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:39:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:39:25,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:39:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:39:25,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834278445] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:39:25,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:39:25,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-14 15:39:25,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867126630] [2022-07-14 15:39:25,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:39:25,558 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:39:25,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:25,558 INFO L85 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 2 times [2022-07-14 15:39:25,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:25,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909072062] [2022-07-14 15:39:25,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:25,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:25,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:25,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:25,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:39:25,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 15:39:25,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-14 15:39:25,615 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 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-14 15:39:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:39:25,637 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-07-14 15:39:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 15:39:25,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2022-07-14 15:39:25,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-14 15:39:25,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 48 transitions. [2022-07-14 15:39:25,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-14 15:39:25,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-14 15:39:25,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2022-07-14 15:39:25,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:39:25,642 INFO L369 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-07-14 15:39:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2022-07-14 15:39:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-14 15:39:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:39:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-07-14 15:39:25,649 INFO L392 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-07-14 15:39:25,649 INFO L374 stractBuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-07-14 15:39:25,649 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:39:25,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2022-07-14 15:39:25,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-14 15:39:25,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:25,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:25,653 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2022-07-14 15:39:25,653 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:39:25,653 INFO L752 eck$LassoCheckResult]: Stem: 407#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 391#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 392#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 412#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 413#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 414#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 419#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 418#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 417#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 416#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 415#L90-3 assume !(main_~i~1#1 < 8); 400#L90-4 call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 401#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 397#L63-4 [2022-07-14 15:39:25,653 INFO L754 eck$LassoCheckResult]: Loop: 397#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 382#L66 assume !parse_expression_list_#t~switch5#1; 383#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 398#L63-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 399#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 397#L63-4 [2022-07-14 15:39:25,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:25,654 INFO L85 PathProgramCache]: Analyzing trace with hash 82232674, now seen corresponding path program 2 times [2022-07-14 15:39:25,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:25,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337703444] [2022-07-14 15:39:25,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:25,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:39:25,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:39:25,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337703444] [2022-07-14 15:39:25,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337703444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:39:25,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185139495] [2022-07-14 15:39:25,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:39:25,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:39:25,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:25,728 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:39:25,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 15:39:25,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:39:25,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:39:25,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:39:25,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:39:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:39:25,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:39:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:39:25,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185139495] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:39:25,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:39:25,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-14 15:39:25,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182152048] [2022-07-14 15:39:25,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:39:25,841 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:39:25,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:25,841 INFO L85 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 3 times [2022-07-14 15:39:25,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:25,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238848105] [2022-07-14 15:39:25,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:25,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:25,850 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:25,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:25,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:39:25,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 15:39:25,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-07-14 15:39:25,908 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:39:25,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:39:25,937 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-14 15:39:25,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 15:39:25,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2022-07-14 15:39:25,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-14 15:39:25,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2022-07-14 15:39:25,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-14 15:39:25,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-14 15:39:25,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2022-07-14 15:39:25,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:39:25,941 INFO L369 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-07-14 15:39:25,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2022-07-14 15:39:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-07-14 15:39:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:39:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-07-14 15:39:25,945 INFO L392 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-07-14 15:39:25,945 INFO L374 stractBuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-07-14 15:39:25,945 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:39:25,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 56 transitions. [2022-07-14 15:39:25,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-14 15:39:25,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:25,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:25,947 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2022-07-14 15:39:25,947 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:39:25,948 INFO L752 eck$LassoCheckResult]: Stem: 578#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 561#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 562#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 584#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 585#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 582#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 583#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 597#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 596#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 595#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 594#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 593#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 592#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 591#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 590#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 589#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 588#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 587#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 586#L90-3 assume !(main_~i~1#1 < 8); 570#L90-4 call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 571#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 567#L63-4 [2022-07-14 15:39:25,948 INFO L754 eck$LassoCheckResult]: Loop: 567#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 552#L66 assume !parse_expression_list_#t~switch5#1; 553#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 568#L63-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 569#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 567#L63-4 [2022-07-14 15:39:25,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash 684732762, now seen corresponding path program 3 times [2022-07-14 15:39:25,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:25,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726152416] [2022-07-14 15:39:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:25,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:25,988 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:26,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:26,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 4 times [2022-07-14 15:39:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:26,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370933309] [2022-07-14 15:39:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:26,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:26,019 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:26,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:26,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:26,022 INFO L85 PathProgramCache]: Analyzing trace with hash 299059334, now seen corresponding path program 1 times [2022-07-14 15:39:26,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:26,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428005483] [2022-07-14 15:39:26,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:26,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:26,057 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:26,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:30,123 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:39:30,123 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:39:30,123 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:39:30,123 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:39:30,124 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:39:30,124 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:30,124 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:39:30,124 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:39:30,124 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration5_Lasso [2022-07-14 15:39:30,124 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:39:30,124 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:39:30,126 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-14 15:39:30,128 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-14 15:39:30,130 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-14 15:39:30,132 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-14 15:39:30,134 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-14 15:39:30,136 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-14 15:39:30,137 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-14 15:39:30,139 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-14 15:39:30,140 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-14 15:39:30,142 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-14 15:39:30,144 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-14 15:39:30,145 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-14 15:39:30,147 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-14 15:39:30,149 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-14 15:39:30,150 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-14 15:39:30,152 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-14 15:39:30,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-14 15:39:30,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-14 15:39:30,156 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-14 15:39:30,158 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-14 15:39:30,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-14 15:39:30,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-14 15:39:30,165 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-14 15:39:30,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-14 15:39:30,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-14 15:39:30,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-14 15:39:30,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-14 15:39:30,172 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-14 15:39:30,174 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-14 15:39:30,175 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-14 15:39:31,294 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-14 15:39:31,569 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:39:31,570 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:39:31,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:31,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:31,608 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-14 15:39:31,609 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-14 15:39:31,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:31,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:31,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:31,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:31,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:31,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:31,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:31,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:31,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:31,665 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-14 15:39:31,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:31,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:31,667 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-14 15:39:31,667 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-14 15:39:31,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:31,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:31,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:31,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:31,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:31,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:31,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:31,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:31,706 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-14 15:39:31,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:31,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:31,708 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-14 15:39:31,708 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-14 15:39:31,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:31,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:31,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:31,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:31,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:31,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:31,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:31,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:31,753 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-14 15:39:31,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:31,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:31,755 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-14 15:39:31,756 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-14 15:39:31,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:31,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:31,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:31,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:31,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:31,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:31,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:31,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:31,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:31,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:31,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:31,797 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-14 15:39:31,797 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-14 15:39:31,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:31,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:31,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:31,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:31,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:31,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:31,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:31,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:31,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:31,824 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-14 15:39:31,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:31,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:31,825 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-14 15:39:31,825 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-14 15:39:31,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:31,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:31,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:31,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:31,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:31,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:31,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:31,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:31,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:31,851 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-14 15:39:31,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:31,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:31,852 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-14 15:39:31,853 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-14 15:39:31,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:31,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:31,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:31,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:31,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:31,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:31,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:31,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:31,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:31,877 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-14 15:39:31,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:31,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:31,879 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-14 15:39:31,879 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-14 15:39:31,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:31,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:31,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:31,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:31,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:31,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:31,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:31,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:31,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:31,905 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-14 15:39:31,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:31,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:31,907 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-14 15:39:31,907 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-14 15:39:31,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:31,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:31,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:31,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:31,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:31,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:31,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:31,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:31,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:31,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-14 15:39:31,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:31,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:31,956 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-14 15:39:31,957 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-14 15:39:31,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:31,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:31,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:31,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:31,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:31,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:31,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:31,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:31,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:31,981 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-14 15:39:31,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:31,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:31,982 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-14 15:39:31,986 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-14 15:39:31,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:31,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:31,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:31,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:31,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:31,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:31,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:31,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:31,994 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,009 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-14 15:39:32,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,010 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-14 15:39:32,010 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-14 15:39:32,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:32,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:32,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:32,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,037 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-14 15:39:32,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,038 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-14 15:39:32,039 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-14 15:39:32,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:32,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,063 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-14 15:39:32,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,064 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-14 15:39:32,065 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-14 15:39:32,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:32,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,073 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,089 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-14 15:39:32,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,090 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-14 15:39:32,091 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-14 15:39:32,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:32,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:32,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,117 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-14 15:39:32,117 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-14 15:39:32,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:32,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,143 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-14 15:39:32,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,145 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-14 15:39:32,146 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-14 15:39:32,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:32,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:32,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,184 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-14 15:39:32,185 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-14 15:39:32,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:32,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,210 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-14 15:39:32,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,211 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-14 15:39:32,212 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-14 15:39:32,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:32,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-14 15:39:32,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,237 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-14 15:39:32,238 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-14 15:39:32,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:32,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-14 15:39:32,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,276 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-14 15:39:32,276 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-14 15:39:32,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:32,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,299 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-14 15:39:32,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,301 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-14 15:39:32,301 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-14 15:39:32,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:32,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,324 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-14 15:39:32,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,325 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-14 15:39:32,326 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-14 15:39:32,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:32,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,355 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-14 15:39:32,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,356 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-14 15:39:32,357 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-14 15:39:32,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:32,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:32,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:32,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:32,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,454 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-14 15:39:32,455 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-14 15:39:32,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:32,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,478 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-14 15:39:32,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,479 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-14 15:39:32,480 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-14 15:39:32,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:32,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,489 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,517 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-14 15:39:32,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,524 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:32,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-14 15:39:32,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:32,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-14 15:39:32,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,549 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-14 15:39:32,550 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-14 15:39:32,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:32,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,572 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-14 15:39:32,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,574 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-14 15:39:32,574 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-14 15:39:32,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:32,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:32,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:32,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:32,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:32,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,601 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-14 15:39:32,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-14 15:39:32,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:32,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:32,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:32,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,641 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-14 15:39:32,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,642 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-14 15:39:32,643 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-14 15:39:32,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:32,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:32,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:32,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:32,683 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-14 15:39:32,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,684 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-14 15:39:32,685 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-14 15:39:32,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:32,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:32,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:32,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:32,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:32,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:32,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:32,712 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:39:32,727 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-14 15:39:32,727 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-14 15:39:32,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:32,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:32,732 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-14 15:39:32,733 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-14 15:39:32,733 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:39:32,754 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:39:32,754 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:39:32,754 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str#1.offset, v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_1, ULTIMATE.start_parse_expression_list_~i~0#1) = -1*ULTIMATE.start_parse_expression_list_~str#1.offset + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_1 - 1*ULTIMATE.start_parse_expression_list_~i~0#1 Supporting invariants [] [2022-07-14 15:39:32,770 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-14 15:39:32,903 INFO L293 tatePredicateManager]: 67 out of 67 supporting invariants were superfluous and have been removed [2022-07-14 15:39:32,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:32,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:39:32,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:39:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:32,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:39:32,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:39:32,986 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-14 15:39:32,986 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:39:32,986 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:39:33,008 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 92 transitions. Complement of second has 4 states. [2022-07-14 15:39:33,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-14 15:39:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:39:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-07-14 15:39:33,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 5 letters. [2022-07-14 15:39:33,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:39:33,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 26 letters. Loop has 5 letters. [2022-07-14 15:39:33,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:39:33,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 10 letters. [2022-07-14 15:39:33,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:39:33,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. [2022-07-14 15:39:33,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:39:33,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 59 states and 75 transitions. [2022-07-14 15:39:33,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-14 15:39:33,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-14 15:39:33,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 75 transitions. [2022-07-14 15:39:33,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:39:33,012 INFO L369 hiAutomatonCegarLoop]: Abstraction has 59 states and 75 transitions. [2022-07-14 15:39:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 75 transitions. [2022-07-14 15:39:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-07-14 15:39:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 57 states have internal predecessors, (74), 0 states have call successors, (0), 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-14 15:39:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2022-07-14 15:39:33,014 INFO L392 hiAutomatonCegarLoop]: Abstraction has 58 states and 74 transitions. [2022-07-14 15:39:33,014 INFO L374 stractBuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2022-07-14 15:39:33,014 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:39:33,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 74 transitions. [2022-07-14 15:39:33,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:39:33,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:33,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:33,015 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:39:33,015 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:39:33,015 INFO L752 eck$LassoCheckResult]: Stem: 1072#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 1050#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 1051#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1079#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1080#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1081#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1094#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1093#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1092#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1091#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1090#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1089#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1088#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1087#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1086#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1085#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1084#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1083#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1082#L90-3 assume !(main_~i~1#1 < 8); 1064#L90-4 call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 1065#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1058#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 1037#L66 assume parse_expression_list_#t~switch5#1; 1040#L67-5 [2022-07-14 15:39:33,015 INFO L754 eck$LassoCheckResult]: Loop: 1040#L67-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 1048#L67-1 assume parse_expression_list_#t~short8#1; 1066#L67-3 assume !!parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1;parse_expression_list_#t~post9#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post9#1;havoc parse_expression_list_#t~post9#1; 1040#L67-5 [2022-07-14 15:39:33,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:33,015 INFO L85 PathProgramCache]: Analyzing trace with hash 898188797, now seen corresponding path program 1 times [2022-07-14 15:39:33,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:33,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451559873] [2022-07-14 15:39:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:33,030 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:33,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:33,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 1 times [2022-07-14 15:39:33,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:33,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621866836] [2022-07-14 15:39:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:33,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:33,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:33,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:33,078 INFO L85 PathProgramCache]: Analyzing trace with hash 296230220, now seen corresponding path program 1 times [2022-07-14 15:39:33,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:33,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543052992] [2022-07-14 15:39:33,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:33,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:33,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-14 15:39:33,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:39:33,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543052992] [2022-07-14 15:39:33,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543052992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:39:33,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:39:33,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 15:39:33,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411614884] [2022-07-14 15:39:33,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:39:33,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:39:33,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 15:39:33,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 15:39:33,191 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. cyclomatic complexity: 20 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:39:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:39:33,295 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2022-07-14 15:39:33,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 15:39:33,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 118 transitions. [2022-07-14 15:39:33,296 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-07-14 15:39:33,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 118 transitions. [2022-07-14 15:39:33,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-14 15:39:33,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-07-14 15:39:33,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 118 transitions. [2022-07-14 15:39:33,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:39:33,297 INFO L369 hiAutomatonCegarLoop]: Abstraction has 91 states and 118 transitions. [2022-07-14 15:39:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 118 transitions. [2022-07-14 15:39:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2022-07-14 15:39:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 64 states have internal predecessors, (83), 0 states have call successors, (0), 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-14 15:39:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2022-07-14 15:39:33,299 INFO L392 hiAutomatonCegarLoop]: Abstraction has 65 states and 83 transitions. [2022-07-14 15:39:33,299 INFO L374 stractBuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2022-07-14 15:39:33,300 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 15:39:33,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 83 transitions. [2022-07-14 15:39:33,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:39:33,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:33,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:33,300 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:39:33,300 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:39:33,301 INFO L752 eck$LassoCheckResult]: Stem: 1246#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 1221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 1222#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1253#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1254#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1255#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1268#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1267#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1266#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1265#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1264#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1263#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1262#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1261#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1260#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1259#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1258#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1257#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1256#L90-3 assume !(main_~i~1#1 < 8); 1236#L90-4 call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 1237#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1229#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 1206#L66 assume !parse_expression_list_#t~switch5#1; 1207#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 1232#L63-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 1233#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 1230#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 1231#L66 assume parse_expression_list_#t~switch5#1; 1217#L67-5 [2022-07-14 15:39:33,301 INFO L754 eck$LassoCheckResult]: Loop: 1217#L67-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 1218#L67-1 assume parse_expression_list_#t~short8#1; 1270#L67-3 assume !!parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1;parse_expression_list_#t~post9#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post9#1;havoc parse_expression_list_#t~post9#1; 1217#L67-5 [2022-07-14 15:39:33,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:33,301 INFO L85 PathProgramCache]: Analyzing trace with hash -366788055, now seen corresponding path program 1 times [2022-07-14 15:39:33,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:33,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466520407] [2022-07-14 15:39:33,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:33,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:33,338 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:33,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:33,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:33,359 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 2 times [2022-07-14 15:39:33,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:33,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130842997] [2022-07-14 15:39:33,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:33,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:33,361 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:33,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:33,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:33,363 INFO L85 PathProgramCache]: Analyzing trace with hash -586112608, now seen corresponding path program 1 times [2022-07-14 15:39:33,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:33,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047754337] [2022-07-14 15:39:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:33,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:33,374 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:33,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:38,575 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:39:38,575 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:39:38,575 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:39:38,575 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:39:38,575 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:39:38,575 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:38,575 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:39:38,575 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:39:38,576 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration7_Lasso [2022-07-14 15:39:38,576 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:39:38,576 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:39:38,580 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-14 15:39:38,582 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-14 15:39:38,584 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-14 15:39:38,586 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-14 15:39:38,587 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-14 15:39:38,588 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-14 15:39:38,590 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-14 15:39:38,591 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-14 15:39:38,593 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-14 15:39:38,594 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-14 15:39:39,740 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-14 15:39:39,742 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-14 15:39:39,744 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-14 15:39:39,745 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-14 15:39:39,746 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-14 15:39:39,749 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-14 15:39:39,750 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-14 15:39:39,751 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-14 15:39:39,752 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-14 15:39:39,754 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-14 15:39:39,755 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-14 15:39:39,756 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-14 15:39:39,757 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-14 15:39:39,758 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-14 15:39:39,760 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-14 15:39:39,761 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-14 15:39:39,762 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-14 15:39:39,767 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-14 15:39:39,769 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-14 15:39:40,098 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:39:40,098 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:39:40,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,105 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-14 15:39:40,106 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-14 15:39:40,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:40,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:40,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:40,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:40,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,131 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-14 15:39:40,131 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-14 15:39:40,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,156 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-14 15:39:40,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,157 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-14 15:39:40,157 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-14 15:39:40,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:40,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:40,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:40,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:40,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:40,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,196 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-14 15:39:40,196 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-14 15:39:40,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:40,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:40,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:40,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,219 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-14 15:39:40,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,220 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-14 15:39:40,221 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-14 15:39:40,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:40,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:40,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:40,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:40,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:40,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,254 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-14 15:39:40,254 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-14 15:39:40,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:40,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:40,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:40,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,288 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-14 15:39:40,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,289 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-14 15:39:40,289 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-14 15:39:40,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-14 15:39:40,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,331 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-14 15:39:40,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:40,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:40,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:40,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-14 15:39:40,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,363 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-14 15:39:40,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:40,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:40,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:40,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:40,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-14 15:39:40,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,387 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-14 15:39:40,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-14 15:39:40,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,419 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-14 15:39:40,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:40,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:40,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,447 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-14 15:39:40,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-07-14 15:39:40,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,477 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-14 15:39:40,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:40,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:40,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,504 INFO L229 MonitoredProcess]: Starting monitored process 56 with /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-14 15:39:40,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-14 15:39:40,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-07-14 15:39:40,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,567 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-14 15:39:40,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-14 15:39:40,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,594 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-14 15:39:40,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:40,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:40,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,641 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-14 15:39:40,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:40,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,667 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-14 15:39:40,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-14 15:39:40,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,694 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-14 15:39:40,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-14 15:39:40,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,721 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-14 15:39:40,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:40,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,746 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-14 15:39:40,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:40,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,783 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-14 15:39:40,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-14 15:39:40,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,808 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-14 15:39:40,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:40,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,835 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-14 15:39:40,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-14 15:39:40,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,878 INFO L229 MonitoredProcess]: Starting monitored process 67 with /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-14 15:39:40,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-14 15:39:40,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:40,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-14 15:39:40,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,915 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-14 15:39:40,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-14 15:39:40,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-14 15:39:40,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,964 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-14 15:39:40,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:40,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:40,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:40,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:40,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:40,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:40,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:40,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:40,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:40,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:40,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:40,992 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:40,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-14 15:39:40,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:41,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:41,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:41,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:41,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:41,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:41,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:41,021 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:39:41,036 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-14 15:39:41,036 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. [2022-07-14 15:39:41,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:41,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:41,037 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:41,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-14 15:39:41,039 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:39:41,046 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:39:41,046 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:39:41,046 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~start~0#1, v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_2, ULTIMATE.start_parse_expression_list_~str#1.offset) = -1*ULTIMATE.start_parse_expression_list_~start~0#1 + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_2 - 1*ULTIMATE.start_parse_expression_list_~str#1.offset Supporting invariants [] [2022-07-14 15:39:41,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-07-14 15:39:41,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:41,319 INFO L293 tatePredicateManager]: 90 out of 90 supporting invariants were superfluous and have been removed [2022-07-14 15:39:41,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:41,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:39:41,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:39:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:41,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:39:41,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:39:41,391 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-14 15:39:41,392 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:39:41,392 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:39:41,430 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 176 states and 237 transitions. Complement of second has 7 states. [2022-07-14 15:39:41,431 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-14 15:39:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:39:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-07-14 15:39:41,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 28 letters. Loop has 3 letters. [2022-07-14 15:39:41,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:39:41,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 31 letters. Loop has 3 letters. [2022-07-14 15:39:41,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:39:41,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 28 letters. Loop has 6 letters. [2022-07-14 15:39:41,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:39:41,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 237 transitions. [2022-07-14 15:39:41,434 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2022-07-14 15:39:41,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 136 states and 181 transitions. [2022-07-14 15:39:41,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-07-14 15:39:41,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-07-14 15:39:41,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 181 transitions. [2022-07-14 15:39:41,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:39:41,436 INFO L369 hiAutomatonCegarLoop]: Abstraction has 136 states and 181 transitions. [2022-07-14 15:39:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 181 transitions. [2022-07-14 15:39:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2022-07-14 15:39:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 90 states have internal predecessors, (122), 0 states have call successors, (0), 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-14 15:39:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2022-07-14 15:39:41,439 INFO L392 hiAutomatonCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-07-14 15:39:41,439 INFO L374 stractBuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-07-14 15:39:41,439 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 15:39:41,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 122 transitions. [2022-07-14 15:39:41,440 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:39:41,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:41,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:41,440 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:39:41,440 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:39:41,440 INFO L752 eck$LassoCheckResult]: Stem: 1967#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 1941#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 1942#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1975#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1976#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1977#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1992#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1991#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1990#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1989#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1988#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1987#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1986#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1985#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1984#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1983#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1982#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 1981#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1980#L90-3 assume !(main_~i~1#1 < 8); 1956#L90-4 call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 1957#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1949#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 1950#L66 assume parse_expression_list_#t~switch5#1; 1935#L67-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 1936#L67-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 2012#L67-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 1994#L67-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 2010#L68 assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; 1943#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 1931#L70-8 [2022-07-14 15:39:41,440 INFO L754 eck$LassoCheckResult]: Loop: 1931#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 1947#L70-1 assume !parse_expression_list_#t~short15#1; 1930#L70-6 assume !!parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1;parse_expression_list_#t~post16#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post16#1 - 1;havoc parse_expression_list_#t~post16#1; 1931#L70-8 [2022-07-14 15:39:41,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 1 times [2022-07-14 15:39:41,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:41,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891059058] [2022-07-14 15:39:41,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:41,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-14 15:39:41,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:39:41,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891059058] [2022-07-14 15:39:41,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891059058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:39:41,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:39:41,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 15:39:41,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146894488] [2022-07-14 15:39:41,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:39:41,523 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:39:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:41,523 INFO L85 PathProgramCache]: Analyzing trace with hash 89761, now seen corresponding path program 1 times [2022-07-14 15:39:41,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:41,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154989519] [2022-07-14 15:39:41,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:41,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:41,533 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-14 15:39:41,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:39:41,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154989519] [2022-07-14 15:39:41,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154989519] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:39:41,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:39:41,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 15:39:41,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093843517] [2022-07-14 15:39:41,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:39:41,534 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:39:41,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:39:41,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:39:41,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:39:41,534 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. cyclomatic complexity: 38 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-14 15:39:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:39:41,540 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-07-14 15:39:41,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:39:41,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 123 transitions. [2022-07-14 15:39:41,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:39:41,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 122 transitions. [2022-07-14 15:39:41,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-14 15:39:41,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-07-14 15:39:41,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 122 transitions. [2022-07-14 15:39:41,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:39:41,542 INFO L369 hiAutomatonCegarLoop]: Abstraction has 92 states and 122 transitions. [2022-07-14 15:39:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 122 transitions. [2022-07-14 15:39:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-14 15:39:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.326086956521739) internal successors, (122), 91 states have internal predecessors, (122), 0 states have call successors, (0), 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-14 15:39:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2022-07-14 15:39:41,544 INFO L392 hiAutomatonCegarLoop]: Abstraction has 92 states and 122 transitions. [2022-07-14 15:39:41,544 INFO L374 stractBuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2022-07-14 15:39:41,544 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 15:39:41,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 122 transitions. [2022-07-14 15:39:41,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:39:41,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:41,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:41,546 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:39:41,546 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:39:41,546 INFO L752 eck$LassoCheckResult]: Stem: 2161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 2134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 2135#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2168#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2169#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2171#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2195#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2194#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2193#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2192#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2191#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2189#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2187#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2185#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2182#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2181#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2179#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2175#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2174#L90-3 assume !(main_~i~1#1 < 8); 2150#L90-4 call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 2151#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2143#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 2144#L66 assume parse_expression_list_#t~switch5#1; 2129#L67-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 2130#L67-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 2199#L67-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 2196#L67-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 2172#L68 assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; 2136#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2126#L70-8 [2022-07-14 15:39:41,546 INFO L754 eck$LassoCheckResult]: Loop: 2126#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 2141#L70-1 assume parse_expression_list_#t~short15#1;call parse_expression_list_#t~mem12#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short14#1 := 32 == parse_expression_list_#t~mem12#1; 2166#L70-2 assume parse_expression_list_#t~short14#1; 2156#L70-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 2125#L70-6 assume !!parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1;parse_expression_list_#t~post16#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post16#1 - 1;havoc parse_expression_list_#t~post16#1; 2126#L70-8 [2022-07-14 15:39:41,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:41,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 2 times [2022-07-14 15:39:41,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:41,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396684056] [2022-07-14 15:39:41,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:41,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-14 15:39:41,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:39:41,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396684056] [2022-07-14 15:39:41,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396684056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:39:41,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:39:41,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 15:39:41,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398836019] [2022-07-14 15:39:41,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:39:41,646 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:39:41,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:41,646 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 1 times [2022-07-14 15:39:41,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:41,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041811503] [2022-07-14 15:39:41,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:41,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:41,658 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:41,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:41,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:39:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 15:39:41,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 15:39:41,711 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. cyclomatic complexity: 37 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-14 15:39:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:39:41,824 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2022-07-14 15:39:41,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 15:39:41,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 159 transitions. [2022-07-14 15:39:41,826 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-07-14 15:39:41,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 117 states and 151 transitions. [2022-07-14 15:39:41,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-07-14 15:39:41,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-07-14 15:39:41,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 151 transitions. [2022-07-14 15:39:41,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:39:41,826 INFO L369 hiAutomatonCegarLoop]: Abstraction has 117 states and 151 transitions. [2022-07-14 15:39:41,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 151 transitions. [2022-07-14 15:39:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2022-07-14 15:39:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 87 states have internal predecessors, (116), 0 states have call successors, (0), 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-14 15:39:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2022-07-14 15:39:41,829 INFO L392 hiAutomatonCegarLoop]: Abstraction has 88 states and 116 transitions. [2022-07-14 15:39:41,829 INFO L374 stractBuchiCegarLoop]: Abstraction has 88 states and 116 transitions. [2022-07-14 15:39:41,829 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-14 15:39:41,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 116 transitions. [2022-07-14 15:39:41,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:39:41,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:41,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:41,830 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:39:41,830 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:39:41,830 INFO L752 eck$LassoCheckResult]: Stem: 2393#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 2366#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 2367#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2398#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2399#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2401#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2414#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2413#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2412#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2411#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2410#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2409#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2408#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2407#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2406#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2405#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2404#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2403#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2402#L90-3 assume !(main_~i~1#1 < 8); 2382#L90-4 call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 2383#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2375#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 2354#L66 assume parse_expression_list_#t~switch5#1; 2357#L67-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 2364#L67-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 2387#L67-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 2388#L67-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 2391#L68 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 2368#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2361#L70-8 [2022-07-14 15:39:41,830 INFO L754 eck$LassoCheckResult]: Loop: 2361#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 2373#L70-1 assume parse_expression_list_#t~short15#1;call parse_expression_list_#t~mem12#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short14#1 := 32 == parse_expression_list_#t~mem12#1; 2396#L70-2 assume parse_expression_list_#t~short14#1; 2384#L70-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 2360#L70-6 assume !!parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1;parse_expression_list_#t~post16#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post16#1 - 1;havoc parse_expression_list_#t~post16#1; 2361#L70-8 [2022-07-14 15:39:41,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:41,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1161473974, now seen corresponding path program 1 times [2022-07-14 15:39:41,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:41,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020482978] [2022-07-14 15:39:41,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:41,846 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:41,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:41,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:41,871 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 2 times [2022-07-14 15:39:41,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:41,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293565268] [2022-07-14 15:39:41,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:41,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:41,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:41,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:41,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:41,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1035891741, now seen corresponding path program 1 times [2022-07-14 15:39:41,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:41,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318662371] [2022-07-14 15:39:41,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:41,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-14 15:39:41,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:39:41,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318662371] [2022-07-14 15:39:41,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318662371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:39:41,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:39:41,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 15:39:41,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678119595] [2022-07-14 15:39:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:39:41,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:39:41,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 15:39:41,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 15:39:41,954 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. cyclomatic complexity: 35 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-14 15:39:42,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:39:42,010 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2022-07-14 15:39:42,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 15:39:42,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 172 transitions. [2022-07-14 15:39:42,011 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-07-14 15:39:42,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 127 states and 164 transitions. [2022-07-14 15:39:42,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-14 15:39:42,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-14 15:39:42,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 164 transitions. [2022-07-14 15:39:42,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:39:42,012 INFO L369 hiAutomatonCegarLoop]: Abstraction has 127 states and 164 transitions. [2022-07-14 15:39:42,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 164 transitions. [2022-07-14 15:39:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2022-07-14 15:39:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 91 states have internal predecessors, (119), 0 states have call successors, (0), 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-14 15:39:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2022-07-14 15:39:42,014 INFO L392 hiAutomatonCegarLoop]: Abstraction has 92 states and 119 transitions. [2022-07-14 15:39:42,014 INFO L374 stractBuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2022-07-14 15:39:42,014 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-14 15:39:42,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 119 transitions. [2022-07-14 15:39:42,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:39:42,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:42,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:42,015 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:39:42,015 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:39:42,015 INFO L752 eck$LassoCheckResult]: Stem: 2635#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 2606#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 2607#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2643#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2644#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2646#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2662#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2661#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2660#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2659#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2658#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2657#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2656#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2655#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2654#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2653#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2652#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 2648#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2647#L90-3 assume !(main_~i~1#1 < 8); 2620#L90-4 call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 2621#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2615#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 2594#L66 assume !parse_expression_list_#t~switch5#1; 2595#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 2685#L63-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 2684#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 2680#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 2676#L66 assume parse_expression_list_#t~switch5#1; 2677#L67-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 2675#L67-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 2674#L67-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 2671#L67-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 2637#L68 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 2608#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2600#L70-8 [2022-07-14 15:39:42,015 INFO L754 eck$LassoCheckResult]: Loop: 2600#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 2613#L70-1 assume parse_expression_list_#t~short15#1;call parse_expression_list_#t~mem12#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short14#1 := 32 == parse_expression_list_#t~mem12#1; 2641#L70-2 assume parse_expression_list_#t~short14#1; 2629#L70-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 2599#L70-6 assume !!parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1;parse_expression_list_#t~post16#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post16#1 - 1;havoc parse_expression_list_#t~post16#1; 2600#L70-8 [2022-07-14 15:39:42,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1836811402, now seen corresponding path program 1 times [2022-07-14 15:39:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:42,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350012036] [2022-07-14 15:39:42,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:42,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:42,026 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:42,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:42,036 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 3 times [2022-07-14 15:39:42,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:42,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988632035] [2022-07-14 15:39:42,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:42,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:42,039 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:42,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:42,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:42,041 INFO L85 PathProgramCache]: Analyzing trace with hash 282551409, now seen corresponding path program 1 times [2022-07-14 15:39:42,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:42,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941437716] [2022-07-14 15:39:42,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:42,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-14 15:39:42,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:39:42,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941437716] [2022-07-14 15:39:42,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941437716] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:39:42,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042606093] [2022-07-14 15:39:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:42,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:39:42,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:42,077 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:39:42,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-07-14 15:39:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:42,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:39:42,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:39:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-14 15:39:42,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:39:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-14 15:39:42,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042606093] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:39:42,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:39:42,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-07-14 15:39:42,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647933211] [2022-07-14 15:39:42,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:39:42,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:39:42,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 15:39:42,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 15:39:42,254 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. cyclomatic complexity: 34 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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-14 15:39:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:39:42,335 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2022-07-14 15:39:42,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 15:39:42,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 239 transitions. [2022-07-14 15:39:42,337 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-14 15:39:42,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 167 states and 217 transitions. [2022-07-14 15:39:42,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-07-14 15:39:42,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-07-14 15:39:42,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 217 transitions. [2022-07-14 15:39:42,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:39:42,338 INFO L369 hiAutomatonCegarLoop]: Abstraction has 167 states and 217 transitions. [2022-07-14 15:39:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 217 transitions. [2022-07-14 15:39:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 132. [2022-07-14 15:39:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.303030303030303) internal successors, (172), 131 states have internal predecessors, (172), 0 states have call successors, (0), 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-14 15:39:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 172 transitions. [2022-07-14 15:39:42,340 INFO L392 hiAutomatonCegarLoop]: Abstraction has 132 states and 172 transitions. [2022-07-14 15:39:42,340 INFO L374 stractBuchiCegarLoop]: Abstraction has 132 states and 172 transitions. [2022-07-14 15:39:42,340 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-14 15:39:42,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 172 transitions. [2022-07-14 15:39:42,341 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-07-14 15:39:42,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:42,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:42,341 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:39:42,341 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:39:42,341 INFO L752 eck$LassoCheckResult]: Stem: 3159#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 3132#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 3133#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 3165#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3166#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 3167#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3183#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 3182#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3181#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 3180#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3179#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 3178#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3177#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 3176#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3175#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 3174#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3173#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 3169#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3168#L90-3 assume !(main_~i~1#1 < 8); 3146#L90-4 call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 3147#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 3141#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 3142#L66 assume !parse_expression_list_#t~switch5#1; 3227#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 3225#L63-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 3223#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 3221#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 3219#L66 assume !parse_expression_list_#t~switch5#1; 3216#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 3249#L63-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 3248#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 3218#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 3215#L66 assume parse_expression_list_#t~switch5#1; 3213#L67-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 3209#L67-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 3200#L67-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 3195#L67-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 3184#L68 assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; 3134#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 3125#L70-8 [2022-07-14 15:39:42,341 INFO L754 eck$LassoCheckResult]: Loop: 3125#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 3139#L70-1 assume parse_expression_list_#t~short15#1;call parse_expression_list_#t~mem12#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short14#1 := 32 == parse_expression_list_#t~mem12#1; 3163#L70-2 assume parse_expression_list_#t~short14#1; 3153#L70-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 3124#L70-6 assume !!parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1;parse_expression_list_#t~post16#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post16#1 - 1;havoc parse_expression_list_#t~post16#1; 3125#L70-8 [2022-07-14 15:39:42,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:42,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1704815500, now seen corresponding path program 1 times [2022-07-14 15:39:42,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:42,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327009899] [2022-07-14 15:39:42,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:42,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:42,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:42,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:42,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:42,383 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 4 times [2022-07-14 15:39:42,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:42,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675248748] [2022-07-14 15:39:42,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:42,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:42,386 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:42,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:42,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:42,388 INFO L85 PathProgramCache]: Analyzing trace with hash 492769819, now seen corresponding path program 1 times [2022-07-14 15:39:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:42,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402504241] [2022-07-14 15:39:42,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:42,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:42,401 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:42,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:48,535 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 305 DAG size of output: 214 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-14 15:39:49,073 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:39:49,074 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:39:49,074 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:39:49,074 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:39:49,074 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:39:49,074 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:49,074 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:39:49,074 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:39:49,074 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration12_Lasso [2022-07-14 15:39:49,074 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:39:49,074 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:39:49,076 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-14 15:39:49,084 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-14 15:39:49,085 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-14 15:39:49,087 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-14 15:39:49,089 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-14 15:39:49,090 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-14 15:39:49,091 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-14 15:39:49,093 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-14 15:39:49,094 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-14 15:39:49,095 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-14 15:39:49,097 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-14 15:39:49,098 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-14 15:39:49,099 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-14 15:39:49,101 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-14 15:39:49,102 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-14 15:39:49,103 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-14 15:39:49,104 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-14 15:39:49,106 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-14 15:39:49,107 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-14 15:39:49,110 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-14 15:39:49,113 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-14 15:39:49,114 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-14 15:39:49,115 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-14 15:39:49,116 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-14 15:39:49,118 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-14 15:39:49,119 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-14 15:39:49,120 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-14 15:39:49,122 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-14 15:39:49,123 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-14 15:39:50,703 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:39:50,703 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:39:50,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:50,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:50,705 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:50,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-14 15:39:50,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:50,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:50,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:50,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:50,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:50,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:50,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:50,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:50,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:50,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-07-14 15:39:50,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:50,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:50,729 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:50,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-14 15:39:50,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:50,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:50,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:50,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:50,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:50,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:50,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:50,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:50,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:50,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-14 15:39:50,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:50,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:50,753 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:50,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-14 15:39:50,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:50,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:50,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:50,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:50,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:50,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:50,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:50,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:50,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:50,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:50,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:50,793 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:50,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-14 15:39:50,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:50,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:50,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:50,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:50,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:50,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:50,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:50,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:50,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:50,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-14 15:39:50,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:50,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:50,819 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:50,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-14 15:39:50,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:50,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:50,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:50,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:50,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:50,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:50,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:50,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:50,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:50,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-07-14 15:39:50,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:50,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:50,842 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:50,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-07-14 15:39:50,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:50,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:50,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:50,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:50,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:50,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:50,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:50,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:50,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:50,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-07-14 15:39:50,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:50,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:50,897 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:50,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:50,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:50,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:50,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:50,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:50,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:50,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:50,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:50,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:50,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-14 15:39:50,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:50,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:50,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:50,945 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:50,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-14 15:39:50,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:50,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:50,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:50,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:50,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:50,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:50,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:50,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:50,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:50,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:50,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:50,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:50,984 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:50,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-14 15:39:50,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:50,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:50,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:50,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:50,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:50,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:50,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:50,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-07-14 15:39:51,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,014 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-14 15:39:51,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:51,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:51,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,051 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-14 15:39:51,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:51,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:51,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-07-14 15:39:51,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,077 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-14 15:39:51,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-07-14 15:39:51,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,106 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-14 15:39:51,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:51,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:51,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,130 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-14 15:39:51,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:51,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-07-14 15:39:51,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,154 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-14 15:39:51,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:51,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,179 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-14 15:39:51,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2022-07-14 15:39:51,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,214 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-14 15:39:51,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2022-07-14 15:39:51,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,240 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-14 15:39:51,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:51,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,266 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-14 15:39:51,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:51,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-14 15:39:51,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,293 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-14 15:39:51,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:51,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:51,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-07-14 15:39:51,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,337 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-14 15:39:51,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:51,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:51,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,364 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-07-14 15:39:51,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-07-14 15:39:51,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,397 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-07-14 15:39:51,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:51,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,423 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-07-14 15:39:51,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:51,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:51,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:51,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2022-07-14 15:39:51,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,462 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-07-14 15:39:51,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:51,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,490 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-07-14 15:39:51,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:51,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-07-14 15:39:51,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,524 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-07-14 15:39:51,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-07-14 15:39:51,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,562 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-07-14 15:39:51,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:39:51,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:39:51,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:39:51,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:39:51,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-07-14 15:39:51,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,585 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-07-14 15:39:51,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:51,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:51,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2022-07-14 15:39:51,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,619 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-07-14 15:39:51,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:51,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:51,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2022-07-14 15:39:51,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,652 INFO L229 MonitoredProcess]: Starting monitored process 103 with /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-14 15:39:51,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-07-14 15:39:51,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:51,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:51,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2022-07-14 15:39:51,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,685 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-07-14 15:39:51,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 15:39:51,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:51,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:51,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:39:51,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2022-07-14 15:39:51,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,716 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-07-14 15:39:51,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-14 15:39:51,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:39:51,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:39:51,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:39:51,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:39:51,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:39:51,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:39:51,744 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:39:51,776 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver. [2022-07-14 15:39:51,776 INFO L444 ModelExtractionUtils]: 5 out of 28 variables were initially zero. Simplification set additionally 21 variables to zero. [2022-07-14 15:39:51,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:39:51,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:51,777 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:39:51,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-07-14 15:39:51,779 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:39:51,799 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:39:51,800 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:39:51,800 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0#1) = 1*ULTIMATE.start_parse_expression_list_~j~0#1 Supporting invariants [] [2022-07-14 15:39:51,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2022-07-14 15:39:51,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:52,227 INFO L293 tatePredicateManager]: 103 out of 103 supporting invariants were superfluous and have been removed [2022-07-14 15:39:52,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:52,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:39:52,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:39:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:52,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:39:52,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:39:52,316 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-14 15:39:52,316 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-14 15:39:52,316 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 172 transitions. cyclomatic complexity: 50 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:39:52,376 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 172 transitions. cyclomatic complexity: 50. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 292 states and 386 transitions. Complement of second has 11 states. [2022-07-14 15:39:52,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-14 15:39:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:39:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-07-14 15:39:52,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 5 letters. [2022-07-14 15:39:52,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:39:52,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 44 letters. Loop has 5 letters. [2022-07-14 15:39:52,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:39:52,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 10 letters. [2022-07-14 15:39:52,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:39:52,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 386 transitions. [2022-07-14 15:39:52,379 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2022-07-14 15:39:52,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 192 states and 251 transitions. [2022-07-14 15:39:52,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-14 15:39:52,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-07-14 15:39:52,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 251 transitions. [2022-07-14 15:39:52,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:39:52,380 INFO L369 hiAutomatonCegarLoop]: Abstraction has 192 states and 251 transitions. [2022-07-14 15:39:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 251 transitions. [2022-07-14 15:39:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 138. [2022-07-14 15:39:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 137 states have internal predecessors, (179), 0 states have call successors, (0), 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-14 15:39:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2022-07-14 15:39:52,382 INFO L392 hiAutomatonCegarLoop]: Abstraction has 138 states and 179 transitions. [2022-07-14 15:39:52,382 INFO L374 stractBuchiCegarLoop]: Abstraction has 138 states and 179 transitions. [2022-07-14 15:39:52,382 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-14 15:39:52,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 179 transitions. [2022-07-14 15:39:52,382 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-07-14 15:39:52,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:52,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:52,383 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:39:52,383 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:39:52,383 INFO L752 eck$LassoCheckResult]: Stem: 4158#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 4130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 4131#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4167#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4168#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4169#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4182#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4181#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4180#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4179#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4178#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4177#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4176#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4175#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4174#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4173#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4172#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4171#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4170#L90-3 assume !(main_~i~1#1 < 8); 4146#L90-4 call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 4147#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 4139#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 4140#L66 assume parse_expression_list_#t~switch5#1; 4236#L67-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 4244#L67-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 4243#L67-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 4242#L67-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 4241#L68 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 4240#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 4239#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 4238#L70-1 assume !parse_expression_list_#t~short15#1; 4237#L70-6 assume !parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1; 4235#L70-9 parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; 4233#L71 assume !parse_expression_list_#t~short18#1; 4231#L71-2 assume !parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1; 4229#L71-4 assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; 4227#L73 assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;call r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset := strncpy(r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1);r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset; 4224#L42 parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4223#L15 assume !(0 == __VERIFIER_assert_~cond#1); 4221#L15-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset + (1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1)), 1); 4219#L72 parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1; 4217#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 4214#L63-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 4212#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 4208#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 4204#L66 assume parse_expression_list_#t~switch5#1; 4149#L67-5 [2022-07-14 15:39:52,383 INFO L754 eck$LassoCheckResult]: Loop: 4149#L67-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 4191#L67-1 assume parse_expression_list_#t~short8#1; 4148#L67-3 assume !!parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1;parse_expression_list_#t~post9#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post9#1;havoc parse_expression_list_#t~post9#1; 4149#L67-5 [2022-07-14 15:39:52,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:52,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1896680144, now seen corresponding path program 1 times [2022-07-14 15:39:52,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:52,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065026279] [2022-07-14 15:39:52,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:52,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-14 15:39:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:39:52,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065026279] [2022-07-14 15:39:52,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065026279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:39:52,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:39:52,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 15:39:52,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344825643] [2022-07-14 15:39:52,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:39:52,434 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:39:52,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:52,434 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 3 times [2022-07-14 15:39:52,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:52,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387475749] [2022-07-14 15:39:52,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:52,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:52,436 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:52,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:52,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:39:52,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 15:39:52,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 15:39:52,476 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. cyclomatic complexity: 51 Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:39:52,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:39:52,517 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2022-07-14 15:39:52,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 15:39:52,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 182 transitions. [2022-07-14 15:39:52,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:39:52,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 127 states and 167 transitions. [2022-07-14 15:39:52,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-14 15:39:52,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-14 15:39:52,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 167 transitions. [2022-07-14 15:39:52,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:39:52,519 INFO L369 hiAutomatonCegarLoop]: Abstraction has 127 states and 167 transitions. [2022-07-14 15:39:52,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 167 transitions. [2022-07-14 15:39:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2022-07-14 15:39:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 106 states have internal predecessors, (139), 0 states have call successors, (0), 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-14 15:39:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2022-07-14 15:39:52,521 INFO L392 hiAutomatonCegarLoop]: Abstraction has 107 states and 139 transitions. [2022-07-14 15:39:52,521 INFO L374 stractBuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2022-07-14 15:39:52,521 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-14 15:39:52,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 139 transitions. [2022-07-14 15:39:52,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:39:52,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:52,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:52,522 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:39:52,522 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:39:52,522 INFO L752 eck$LassoCheckResult]: Stem: 4447#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 4421#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 4422#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4456#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4457#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4459#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4488#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4486#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4483#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4482#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4481#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4480#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4479#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4478#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4477#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4475#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4473#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4470#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4469#L90-3 assume !(main_~i~1#1 < 8); 4437#L90-4 call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 4438#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 4430#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 4408#L66 assume !parse_expression_list_#t~switch5#1; 4409#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 4433#L63-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 4434#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 4431#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 4432#L66 assume parse_expression_list_#t~switch5#1; 4418#L67-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 4419#L67-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 4451#L67-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 4514#L67-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 4512#L68 assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; 4449#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 4494#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 4454#L70-1 assume !parse_expression_list_#t~short15#1; 4455#L70-6 assume !parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1; 4464#L70-9 parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; 4462#L71 assume !parse_expression_list_#t~short18#1; 4461#L71-2 assume !parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1; 4435#L71-4 assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; 4436#L73 assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;call r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset := strncpy(r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1);r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset; 4450#L42 parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4448#L15 assume !(0 == __VERIFIER_assert_~cond#1); 4426#L15-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset + (1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1)), 1); 4427#L72 parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1; 4458#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 4490#L63-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 4489#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 4487#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 4484#L66 assume parse_expression_list_#t~switch5#1; 4416#L67-5 [2022-07-14 15:39:52,522 INFO L754 eck$LassoCheckResult]: Loop: 4416#L67-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 4417#L67-1 assume parse_expression_list_#t~short8#1; 4439#L67-3 assume !!parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1;parse_expression_list_#t~post9#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post9#1;havoc parse_expression_list_#t~post9#1; 4416#L67-5 [2022-07-14 15:39:52,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:52,522 INFO L85 PathProgramCache]: Analyzing trace with hash -70433790, now seen corresponding path program 1 times [2022-07-14 15:39:52,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:52,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741047550] [2022-07-14 15:39:52,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:52,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 15:39:52,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:39:52,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741047550] [2022-07-14 15:39:52,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741047550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:39:52,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:39:52,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 15:39:52,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96450143] [2022-07-14 15:39:52,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:39:52,564 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:39:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 4 times [2022-07-14 15:39:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:52,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424005586] [2022-07-14 15:39:52,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:52,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:52,566 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:52,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:39:52,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 15:39:52,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 15:39:52,599 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. cyclomatic complexity: 40 Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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-14 15:39:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:39:52,674 INFO L93 Difference]: Finished difference Result 165 states and 215 transitions. [2022-07-14 15:39:52,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 15:39:52,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 215 transitions. [2022-07-14 15:39:52,675 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:39:52,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 144 states and 185 transitions. [2022-07-14 15:39:52,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-14 15:39:52,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-14 15:39:52,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 185 transitions. [2022-07-14 15:39:52,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:39:52,676 INFO L369 hiAutomatonCegarLoop]: Abstraction has 144 states and 185 transitions. [2022-07-14 15:39:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 185 transitions. [2022-07-14 15:39:52,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 115. [2022-07-14 15:39:52,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.2956521739130435) internal successors, (149), 114 states have internal predecessors, (149), 0 states have call successors, (0), 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-14 15:39:52,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 149 transitions. [2022-07-14 15:39:52,678 INFO L392 hiAutomatonCegarLoop]: Abstraction has 115 states and 149 transitions. [2022-07-14 15:39:52,678 INFO L374 stractBuchiCegarLoop]: Abstraction has 115 states and 149 transitions. [2022-07-14 15:39:52,678 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-14 15:39:52,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 149 transitions. [2022-07-14 15:39:52,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:39:52,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:39:52,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:39:52,679 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:39:52,679 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:39:52,679 INFO L752 eck$LassoCheckResult]: Stem: 4737#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 4710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 4711#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4747#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4748#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4750#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4770#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4769#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4768#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4767#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4766#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4765#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4763#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4761#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4759#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4756#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4755#L90-3 assume !!(main_~i~1#1 < 8);call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; 4754#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4753#L90-3 assume !(main_~i~1#1 < 8); 4726#L90-4 call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 4727#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 4719#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 4720#L66 assume !parse_expression_list_#t~switch5#1; 4751#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 4752#L63-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 4738#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 4739#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 4803#L66 assume parse_expression_list_#t~switch5#1; 4802#L67-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 4801#L67-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 4799#L67-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 4797#L67-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 4741#L68 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 4713#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 4714#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 4718#L70-1 assume !parse_expression_list_#t~short15#1; 4746#L70-6 assume !parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1; 4776#L70-9 parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; 4774#L71 assume !parse_expression_list_#t~short18#1; 4772#L71-2 assume !parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1; 4724#L71-4 assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; 4725#L73 assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;call r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset := strncpy(r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1);r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset; 4742#L42 parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4740#L15 assume !(0 == __VERIFIER_assert_~cond#1); 4715#L15-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset + (1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1)), 1); 4716#L72 parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1; 4749#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 4764#L63-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 4762#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 4760#L63-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 4757#L66 assume parse_expression_list_#t~switch5#1; 4706#L67-5 [2022-07-14 15:39:52,679 INFO L754 eck$LassoCheckResult]: Loop: 4706#L67-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 4707#L67-1 assume parse_expression_list_#t~short8#1; 4730#L67-3 assume !!parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1;parse_expression_list_#t~post9#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post9#1;havoc parse_expression_list_#t~post9#1; 4706#L67-5 [2022-07-14 15:39:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1759377532, now seen corresponding path program 1 times [2022-07-14 15:39:52,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:52,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052089951] [2022-07-14 15:39:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:52,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-14 15:39:52,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:39:52,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052089951] [2022-07-14 15:39:52,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052089951] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:39:52,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034488626] [2022-07-14 15:39:52,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:52,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:39:52,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:39:52,754 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:39:52,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-07-14 15:39:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:39:52,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 15:39:52,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:39:52,849 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 6 treesize of output 5 [2022-07-14 15:39:52,872 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 15:39:52,873 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 11 treesize of output 11 [2022-07-14 15:39:52,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 15:39:52,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-07-14 15:39:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-14 15:39:52,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:39:52,960 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_parse_expression_list_~#str2~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_parse_expression_list_~str#1.base|) (+ |c_ULTIMATE.start_parse_expression_list_~i~0#1| |c_ULTIMATE.start_parse_expression_list_~str#1.offset|)) 0)) is different from false [2022-07-14 15:39:53,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 24 [2022-07-14 15:39:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-14 15:39:53,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034488626] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:39:53,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:39:53,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-07-14 15:39:53,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558319431] [2022-07-14 15:39:53,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:39:53,066 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:39:53,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:39:53,066 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 5 times [2022-07-14 15:39:53,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:39:53,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178345180] [2022-07-14 15:39:53,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:39:53,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:39:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:53,069 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:39:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:39:53,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:39:53,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:39:53,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 15:39:53,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=82, Unknown=1, NotChecked=18, Total=132 [2022-07-14 15:39:53,113 INFO L87 Difference]: Start difference. First operand 115 states and 149 transitions. cyclomatic complexity: 42 Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 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-14 15:39:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:39:53,207 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2022-07-14 15:39:53,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 15:39:53,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 112 transitions. [2022-07-14 15:39:53,208 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:39:53,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2022-07-14 15:39:53,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 15:39:53,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 15:39:53,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 15:39:53,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:39:53,208 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:39:53,208 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:39:53,208 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:39:53,208 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-14 15:39:53,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 15:39:53,208 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:39:53,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 15:39:53,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 03:39:53 BoogieIcfgContainer [2022-07-14 15:39:53,212 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 15:39:53,213 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 15:39:53,213 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 15:39:53,213 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 15:39:53,213 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:39:23" (3/4) ... [2022-07-14 15:39:53,215 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 15:39:53,215 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 15:39:53,215 INFO L158 Benchmark]: Toolchain (without parser) took 29928.61ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 85.7MB in the beginning and 30.8MB in the end (delta: 54.9MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. [2022-07-14 15:39:53,215 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:39:53,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.94ms. Allocated memory is still 115.3MB. Free memory was 85.4MB in the beginning and 88.0MB in the end (delta: -2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 15:39:53,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.31ms. Allocated memory is still 115.3MB. Free memory was 88.0MB in the beginning and 86.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:39:53,216 INFO L158 Benchmark]: Boogie Preprocessor took 35.54ms. Allocated memory is still 115.3MB. Free memory was 86.1MB in the beginning and 84.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:39:53,216 INFO L158 Benchmark]: RCFGBuilder took 299.76ms. Allocated memory is still 115.3MB. Free memory was 84.4MB in the beginning and 70.7MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 15:39:53,216 INFO L158 Benchmark]: BuchiAutomizer took 29314.84ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 70.7MB in the beginning and 30.8MB in the end (delta: 39.9MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2022-07-14 15:39:53,216 INFO L158 Benchmark]: Witness Printer took 2.05ms. Allocated memory is still 138.4MB. Free memory is still 30.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:39:53,217 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.94ms. Allocated memory is still 115.3MB. Free memory was 85.4MB in the beginning and 88.0MB in the end (delta: -2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.31ms. Allocated memory is still 115.3MB. Free memory was 88.0MB in the beginning and 86.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.54ms. Allocated memory is still 115.3MB. Free memory was 86.1MB in the beginning and 84.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 299.76ms. Allocated memory is still 115.3MB. Free memory was 84.4MB in the beginning and 70.7MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 29314.84ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 70.7MB in the beginning and 30.8MB in the end (delta: 39.9MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. * Witness Printer took 2.05ms. Allocated memory is still 138.4MB. Free memory is still 30.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (11 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 15 * unknown-#length-unknown[A] + -2 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[str] + -1 * str and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * start + -1 * str and consists of 4 locations. One deterministic module has affine ranking function j and consists of 6 locations. 11 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.2s and 16 iterations. TraceHistogramMax:8. Analysis of lassos took 27.9s. Construction of modules took 0.4s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 275 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 796 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 792 mSDsluCounter, 1667 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 32 IncrementalHoareTripleChecker+Unchecked, 1125 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 810 IncrementalHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 542 mSDtfsCounter, 810 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU7 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf100 lsp93 ukn84 mio100 lsp32 div100 bol100 ite100 ukn100 eq188 hnf90 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-14 15:39:53,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:53,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:53,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:53,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 15:39:54,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE