./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 839c364b 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:26:10,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:26:10,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:26:10,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:26:10,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:26:10,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:26:10,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:26:10,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:26:10,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:26:10,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:26:10,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:26:10,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:26:10,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:26:10,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:26:10,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:26:10,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:26:10,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:26:10,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:26:10,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:26:10,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:26:10,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:26:10,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:26:10,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:26:10,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:26:10,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:26:10,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:26:10,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:26:10,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:26:10,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:26:10,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:26:10,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:26:10,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:26:10,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:26:10,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:26:10,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:26:10,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:26:10,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:26:10,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:26:10,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:26:10,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:26:10,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:26:10,420 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-14 23:26:10,448 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:26:10,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:26:10,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:26:10,449 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:26:10,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:26:10,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:26:10,450 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:26:10,451 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:26:10,451 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:26:10,451 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:26:10,452 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:26:10,452 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:26:10,452 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:26:10,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:26:10,452 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 23:26:10,452 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:26:10,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:26:10,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 23:26:10,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:26:10,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:26:10,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:26:10,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:26:10,454 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 23:26:10,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:26:10,455 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:26:10,455 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:26:10,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:26:10,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:26:10,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:26:10,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:26:10,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:26:10,456 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:26:10,457 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:26:10,457 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 [2021-12-14 23:26:10,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:26:10,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:26:10,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:26:10,652 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:26:10,652 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:26:10,653 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 [2021-12-14 23:26:10,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29385c6d/dec5e7c7e2b84a9aa06c5d4aae8b4a7b/FLAG110df51e9 [2021-12-14 23:26:11,100 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:26:11,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2021-12-14 23:26:11,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29385c6d/dec5e7c7e2b84a9aa06c5d4aae8b4a7b/FLAG110df51e9 [2021-12-14 23:26:11,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29385c6d/dec5e7c7e2b84a9aa06c5d4aae8b4a7b [2021-12-14 23:26:11,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:26:11,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:26:11,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:26:11,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:26:11,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:26:11,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:26:11" (1/1) ... [2021-12-14 23:26:11,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e6ec67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:11, skipping insertion in model container [2021-12-14 23:26:11,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:26:11" (1/1) ... [2021-12-14 23:26:11,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:26:11,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:26:11,264 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] [2021-12-14 23:26:11,289 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:26:11,294 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:26:11,301 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] [2021-12-14 23:26:11,312 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:26:11,321 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:26:11,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:11 WrapperNode [2021-12-14 23:26:11,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:26:11,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:26:11,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:26:11,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:26:11,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:11" (1/1) ... [2021-12-14 23:26:11,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:11" (1/1) ... [2021-12-14 23:26:11,349 INFO L137 Inliner]: procedures = 42, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2021-12-14 23:26:11,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:26:11,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:26:11,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:26:11,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:26:11,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:11" (1/1) ... [2021-12-14 23:26:11,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:11" (1/1) ... [2021-12-14 23:26:11,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:11" (1/1) ... [2021-12-14 23:26:11,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:11" (1/1) ... [2021-12-14 23:26:11,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:11" (1/1) ... [2021-12-14 23:26:11,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:11" (1/1) ... [2021-12-14 23:26:11,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:11" (1/1) ... [2021-12-14 23:26:11,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:26:11,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:26:11,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:26:11,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:26:11,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:11" (1/1) ... [2021-12-14 23:26:11,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:11,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:11,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:11,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-14 23:26:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 23:26:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 23:26:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 23:26:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 23:26:11,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 23:26:11,449 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-12-14 23:26:11,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:26:11,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:26:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 23:26:11,518 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:26:11,520 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:26:11,666 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:26:11,670 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:26:11,671 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-14 23:26:11,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:26:11 BoogieIcfgContainer [2021-12-14 23:26:11,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:26:11,672 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:26:11,672 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:26:11,680 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:26:11,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:26:11,680 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:26:11" (1/3) ... [2021-12-14 23:26:11,681 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5abb73c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:26:11, skipping insertion in model container [2021-12-14 23:26:11,681 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:26:11,681 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:11" (2/3) ... [2021-12-14 23:26:11,681 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5abb73c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:26:11, skipping insertion in model container [2021-12-14 23:26:11,681 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:26:11,681 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:26:11" (3/3) ... [2021-12-14 23:26:11,682 INFO L388 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2021-12-14 23:26:11,732 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:26:11,732 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:26:11,733 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:26:11,733 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:26:11,733 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:26:11,733 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:26:11,733 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:26:11,733 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:26:11,743 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) [2021-12-14 23:26:11,763 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2021-12-14 23:26:11,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:11,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:11,768 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:26:11,768 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:26:11,768 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:26:11,768 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) [2021-12-14 23:26:11,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2021-12-14 23:26:11,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:11,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:11,772 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:26:11,772 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:26:11,776 INFO L791 eck$LassoCheckResult]: Stem: 21#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); 11#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; 37#L90-3true [2021-12-14 23:26:11,777 INFO L793 eck$LassoCheckResult]: Loop: 37#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; 34#L90-2true main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 37#L90-3true [2021-12-14 23:26:11,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-14 23:26:11,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:11,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941424129] [2021-12-14 23:26:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:11,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:11,862 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:11,886 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:11,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:11,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-12-14 23:26:11,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:11,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724862360] [2021-12-14 23:26:11,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:11,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:11,897 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:11,905 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:11,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:11,909 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-14 23:26:11,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:11,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470003367] [2021-12-14 23:26:11,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:11,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:11,928 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:11,944 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:12,204 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:26:12,205 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:26:12,205 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:26:12,205 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:26:12,205 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:26:12,205 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:12,206 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:26:12,206 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:26:12,206 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2021-12-14 23:26:12,206 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:26:12,206 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:26:12,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:12,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:12,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:12,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:12,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:12,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:12,495 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:26:12,498 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:26:12,499 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:12,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:12,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:12,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:12,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:12,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:12,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:12,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:12,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:12,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:12,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:12,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-14 23:26:12,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:12,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-14 23:26:12,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:12,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:12,540 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:12,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-14 23:26:12,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:12,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:12,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:12,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:12,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:12,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:12,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:12,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:12,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:12,596 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:12,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:12,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:12,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-14 23:26:12,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:12,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:12,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:12,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:12,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:12,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:12,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:12,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:12,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:12,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:12,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:12,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:12,637 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:12,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-14 23:26:12,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:12,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:12,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:12,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:12,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:12,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:12,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:12,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:12,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:12,723 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:12,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:12,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:12,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-14 23:26:12,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:12,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:12,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:12,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:12,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:12,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:12,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:12,743 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:26:12,784 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-14 23:26:12,784 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-12-14 23:26:12,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:12,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:12,786 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:12,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-14 23:26:12,788 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:26:12,831 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:26:12,831 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:26:12,832 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 [] [2021-12-14 23:26:12,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:12,886 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2021-12-14 23:26:12,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:12,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:26:12,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:12,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:26:12,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:13,006 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-14 23:26:13,007 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) [2021-12-14 23:26:13,096 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. [2021-12-14 23:26:13,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-14 23:26:13,100 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) [2021-12-14 23:26:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2021-12-14 23:26:13,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-14 23:26:13,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:13,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-14 23:26:13,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:13,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-14 23:26:13,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:13,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 153 transitions. [2021-12-14 23:26:13,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-14 23:26:13,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 32 states and 43 transitions. [2021-12-14 23:26:13,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-12-14 23:26:13,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-14 23:26:13,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2021-12-14 23:26:13,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:26:13,109 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2021-12-14 23:26:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2021-12-14 23:26:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-14 23:26:13,124 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) [2021-12-14 23:26:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2021-12-14 23:26:13,125 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2021-12-14 23:26:13,125 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2021-12-14 23:26:13,125 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:26:13,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2021-12-14 23:26:13,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-14 23:26:13,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:13,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:13,126 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:13,126 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:13,127 INFO L791 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 [2021-12-14 23:26:13,127 INFO L793 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 [2021-12-14 23:26:13,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2021-12-14 23:26:13,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:13,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446440099] [2021-12-14 23:26:13,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:13,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:13,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:13,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446440099] [2021-12-14 23:26:13,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446440099] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:26:13,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:26:13,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:26:13,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760563537] [2021-12-14 23:26:13,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:26:13,157 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:26:13,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 1 times [2021-12-14 23:26:13,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:13,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186028258] [2021-12-14 23:26:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:13,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:13,162 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:13,166 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:13,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:13,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:26:13,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:26:13,215 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) [2021-12-14 23:26:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:13,228 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2021-12-14 23:26:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:26:13,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2021-12-14 23:26:13,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-14 23:26:13,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2021-12-14 23:26:13,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-14 23:26:13,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-14 23:26:13,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2021-12-14 23:26:13,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:26:13,231 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2021-12-14 23:26:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2021-12-14 23:26:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-12-14 23:26:13,234 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) [2021-12-14 23:26:13,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2021-12-14 23:26:13,234 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2021-12-14 23:26:13,234 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2021-12-14 23:26:13,235 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:26:13,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2021-12-14 23:26:13,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-14 23:26:13,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:13,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:13,235 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:13,236 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:13,236 INFO L791 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 [2021-12-14 23:26:13,236 INFO L793 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 [2021-12-14 23:26:13,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:13,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669544, now seen corresponding path program 1 times [2021-12-14 23:26:13,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:13,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500513861] [2021-12-14 23:26:13,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:13,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:13,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:13,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:13,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500513861] [2021-12-14 23:26:13,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500513861] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:26:13,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493355537] [2021-12-14 23:26:13,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:13,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:26:13,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:13,299 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) [2021-12-14 23:26:13,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 23:26:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:13,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 23:26:13,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:13,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:13,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:26:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:13,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493355537] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:26:13,398 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:26:13,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-14 23:26:13,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317355215] [2021-12-14 23:26:13,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:26:13,399 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:26:13,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:13,399 INFO L85 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 2 times [2021-12-14 23:26:13,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:13,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667299351] [2021-12-14 23:26:13,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:13,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:13,406 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:13,419 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:13,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:13,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 23:26:13,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-14 23:26:13,466 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) [2021-12-14 23:26:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:13,482 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2021-12-14 23:26:13,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 23:26:13,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2021-12-14 23:26:13,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-14 23:26:13,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 48 transitions. [2021-12-14 23:26:13,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-14 23:26:13,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-14 23:26:13,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2021-12-14 23:26:13,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:26:13,486 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2021-12-14 23:26:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2021-12-14 23:26:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-14 23:26:13,488 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) [2021-12-14 23:26:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2021-12-14 23:26:13,488 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2021-12-14 23:26:13,488 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2021-12-14 23:26:13,488 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:26:13,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2021-12-14 23:26:13,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-14 23:26:13,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:13,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:13,489 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2021-12-14 23:26:13,489 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:13,489 INFO L791 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 [2021-12-14 23:26:13,489 INFO L793 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 [2021-12-14 23:26:13,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:13,490 INFO L85 PathProgramCache]: Analyzing trace with hash 82232674, now seen corresponding path program 2 times [2021-12-14 23:26:13,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:13,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067388195] [2021-12-14 23:26:13,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:13,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:13,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:13,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067388195] [2021-12-14 23:26:13,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067388195] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:26:13,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782000142] [2021-12-14 23:26:13,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:26:13,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:26:13,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:13,550 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) [2021-12-14 23:26:13,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 23:26:13,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:26:13,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:26:13,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:26:13,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:13,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:26:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:13,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782000142] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:26:13,669 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:26:13,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-14 23:26:13,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873768427] [2021-12-14 23:26:13,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:26:13,670 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:26:13,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:13,670 INFO L85 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 3 times [2021-12-14 23:26:13,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:13,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234636305] [2021-12-14 23:26:13,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:13,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:13,691 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:13,695 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:13,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:13,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 23:26:13,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-12-14 23:26:13,731 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) [2021-12-14 23:26:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:13,752 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2021-12-14 23:26:13,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 23:26:13,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2021-12-14 23:26:13,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-14 23:26:13,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2021-12-14 23:26:13,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-14 23:26:13,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-14 23:26:13,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2021-12-14 23:26:13,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:26:13,755 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-12-14 23:26:13,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2021-12-14 23:26:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-12-14 23:26:13,757 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) [2021-12-14 23:26:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2021-12-14 23:26:13,757 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-12-14 23:26:13,757 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-12-14 23:26:13,757 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:26:13,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 56 transitions. [2021-12-14 23:26:13,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-14 23:26:13,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:13,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:13,758 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2021-12-14 23:26:13,758 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:13,758 INFO L791 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 [2021-12-14 23:26:13,758 INFO L793 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 [2021-12-14 23:26:13,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:13,758 INFO L85 PathProgramCache]: Analyzing trace with hash 684732762, now seen corresponding path program 3 times [2021-12-14 23:26:13,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:13,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926980620] [2021-12-14 23:26:13,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:13,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:13,777 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:13,794 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:13,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 4 times [2021-12-14 23:26:13,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:13,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592066160] [2021-12-14 23:26:13,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:13,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:13,798 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:13,801 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:13,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash 299059334, now seen corresponding path program 1 times [2021-12-14 23:26:13,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:13,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907488954] [2021-12-14 23:26:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:13,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:13,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:13,871 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:17,898 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:26:17,898 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:26:17,898 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:26:17,898 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:26:17,898 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:26:17,899 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:17,899 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:26:17,899 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:26:17,899 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration5_Lasso [2021-12-14 23:26:17,899 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:26:17,899 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:26:17,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:17,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:18,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:18,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:18,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:18,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:18,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:18,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:18,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:18,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:18,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:18,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:18,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:18,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:18,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:18,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,091 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:26:19,091 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:26:19,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,136 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-14 23:26:19,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,175 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-14 23:26:19,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:19,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:19,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2021-12-14 23:26:19,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,216 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-14 23:26:19,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:19,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:19,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,248 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-14 23:26:19,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:19,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:19,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,292 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-14 23:26:19,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,325 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 [2021-12-14 23:26:19,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,326 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-14 23:26:19,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,353 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-14 23:26:19,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-12-14 23:26:19,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,379 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-14 23:26:19,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,403 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-14 23:26:19,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,462 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,463 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-14 23:26:19,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-12-14 23:26:19,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,509 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-14 23:26:19,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,547 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-14 23:26:19,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:19,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:19,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,574 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-14 23:26:19,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,597 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,617 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-14 23:26:19,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,641 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 [2021-12-14 23:26:19,641 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,643 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-14 23:26:19,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 [2021-12-14 23:26:19,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-14 23:26:19,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,670 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-14 23:26:19,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-14 23:26:19,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,694 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-14 23:26:19,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 [2021-12-14 23:26:19,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:19,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:19,731 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:26:19,747 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-12-14 23:26:19,747 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2021-12-14 23:26:19,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,748 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-14 23:26:19,757 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:26:19,764 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:26:19,764 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:26:19,764 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 [] [2021-12-14 23:26:19,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,909 INFO L297 tatePredicateManager]: 67 out of 67 supporting invariants were superfluous and have been removed [2021-12-14 23:26:19,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:19,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:26:19,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:19,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:26:19,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:20,011 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-14 23:26:20,011 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) [2021-12-14 23:26:20,032 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. [2021-12-14 23:26:20,032 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 [2021-12-14 23:26:20,033 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) [2021-12-14 23:26:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2021-12-14 23:26:20,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 5 letters. [2021-12-14 23:26:20,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:20,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 26 letters. Loop has 5 letters. [2021-12-14 23:26:20,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:20,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 10 letters. [2021-12-14 23:26:20,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:20,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. [2021-12-14 23:26:20,035 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:20,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 59 states and 75 transitions. [2021-12-14 23:26:20,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-14 23:26:20,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-14 23:26:20,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 75 transitions. [2021-12-14 23:26:20,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:20,036 INFO L681 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2021-12-14 23:26:20,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 75 transitions. [2021-12-14 23:26:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2021-12-14 23:26:20,037 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) [2021-12-14 23:26:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2021-12-14 23:26:20,038 INFO L704 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2021-12-14 23:26:20,038 INFO L587 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2021-12-14 23:26:20,038 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:26:20,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 74 transitions. [2021-12-14 23:26:20,038 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:20,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:20,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:20,039 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:20,039 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:26:20,039 INFO L791 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 [2021-12-14 23:26:20,039 INFO L793 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 [2021-12-14 23:26:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash 898188797, now seen corresponding path program 1 times [2021-12-14 23:26:20,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:20,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828565134] [2021-12-14 23:26:20,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:20,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:20,074 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:20,099 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:20,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:20,099 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 1 times [2021-12-14 23:26:20,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:20,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072491311] [2021-12-14 23:26:20,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:20,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:20,102 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:20,104 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:20,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:20,105 INFO L85 PathProgramCache]: Analyzing trace with hash 296230220, now seen corresponding path program 1 times [2021-12-14 23:26:20,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:20,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397803659] [2021-12-14 23:26:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:20,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-14 23:26:20,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:20,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397803659] [2021-12-14 23:26:20,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397803659] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:26:20,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:26:20,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 23:26:20,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255590821] [2021-12-14 23:26:20,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:26:20,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:20,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 23:26:20,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 23:26:20,239 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) [2021-12-14 23:26:20,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:20,370 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2021-12-14 23:26:20,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 23:26:20,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 118 transitions. [2021-12-14 23:26:20,372 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-14 23:26:20,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 118 transitions. [2021-12-14 23:26:20,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-12-14 23:26:20,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-12-14 23:26:20,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 118 transitions. [2021-12-14 23:26:20,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:20,373 INFO L681 BuchiCegarLoop]: Abstraction has 91 states and 118 transitions. [2021-12-14 23:26:20,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 118 transitions. [2021-12-14 23:26:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2021-12-14 23:26:20,375 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) [2021-12-14 23:26:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2021-12-14 23:26:20,375 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2021-12-14 23:26:20,375 INFO L587 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2021-12-14 23:26:20,375 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-14 23:26:20,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 83 transitions. [2021-12-14 23:26:20,375 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:20,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:20,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:20,376 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:20,376 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:26:20,376 INFO L791 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 [2021-12-14 23:26:20,376 INFO L793 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 [2021-12-14 23:26:20,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash -366788055, now seen corresponding path program 1 times [2021-12-14 23:26:20,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:20,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359170895] [2021-12-14 23:26:20,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:20,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:20,389 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:20,413 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:20,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:20,414 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 2 times [2021-12-14 23:26:20,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:20,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932792605] [2021-12-14 23:26:20,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:20,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:20,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:20,419 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:20,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash -586112608, now seen corresponding path program 1 times [2021-12-14 23:26:20,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:20,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463501687] [2021-12-14 23:26:20,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:20,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:20,434 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:20,446 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:25,560 WARN L227 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 250 DAG size of output: 186 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-14 23:26:26,062 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:26:26,062 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:26:26,062 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:26:26,063 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:26:26,063 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:26:26,063 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:26,063 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:26:26,063 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:26:26,063 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration7_Lasso [2021-12-14 23:26:26,063 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:26:26,063 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:26:26,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:26,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:27,368 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:26:27,368 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:26:27,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,369 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-14 23:26:27,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:27,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:27,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:27,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-14 23:26:27,394 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,395 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-14 23:26:27,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-12-14 23:26:27,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,424 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-14 23:26:27,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:27,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:27,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:27,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:27,450 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,451 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-14 23:26:27,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:27,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:27,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:27,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:27,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,477 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-14 23:26:27,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-14 23:26:27,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,503 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-14 23:26:27,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-14 23:26:27,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,530 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-14 23:26:27,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,556 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 [2021-12-14 23:26:27,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,557 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) [2021-12-14 23:26:27,558 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 [2021-12-14 23:26:27,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-12-14 23:26:27,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,584 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-14 23:26:27,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-12-14 23:26:27,612 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,612 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-14 23:26:27,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:27,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,649 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-14 23:26:27,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-12-14 23:26:27,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,694 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-14 23:26:27,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:27,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,724 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-14 23:26:27,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-12-14 23:26:27,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,754 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-14 23:26:27,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:27,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,784 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-14 23:26:27,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-12-14 23:26:27,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,813 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-14 23:26:27,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,841 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 [2021-12-14 23:26:27,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,842 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-14 23:26:27,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 [2021-12-14 23:26:27,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-14 23:26:27,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,878 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-14 23:26:27,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:27,920 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,920 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-14 23:26:27,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,929 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-14 23:26:27,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,932 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-14 23:26:27,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:27,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:27,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-12-14 23:26:27,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:27,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:27,972 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:27,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-14 23:26:27,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:27,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:27,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:27,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:27,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:27,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:27,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:28,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:28,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-12-14 23:26:28,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:28,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:28,029 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:28,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:28,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-14 23:26:28,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:28,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:28,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:28,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:28,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:28,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:28,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:28,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:28,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:28,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:28,075 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:28,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:28,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:28,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:28,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:28,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:28,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:28,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:28,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-14 23:26:28,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:28,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:28,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:28,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:28,116 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:28,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-14 23:26:28,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:28,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:28,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:28,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:28,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:28,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:28,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:28,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:28,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2021-12-14 23:26:28,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:28,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:28,162 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:28,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-14 23:26:28,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:28,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:28,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:28,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:28,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:28,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:28,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:28,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:28,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-14 23:26:28,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:28,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:28,190 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:28,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-14 23:26:28,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:28,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:28,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:28,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:28,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:28,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:28,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:28,213 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:26:28,241 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2021-12-14 23:26:28,241 INFO L444 ModelExtractionUtils]: 4 out of 25 variables were initially zero. Simplification set additionally 17 variables to zero. [2021-12-14 23:26:28,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:28,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:28,242 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:28,244 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:26:28,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-14 23:26:28,261 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-14 23:26:28,261 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:26:28,261 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~start~0#1, v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_3) = -1*ULTIMATE.start_parse_expression_list_~start~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_3 Supporting invariants [1*ULTIMATE.start_parse_expression_list_~str#1.offset >= 0] [2021-12-14 23:26:28,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-12-14 23:26:28,511 INFO L297 tatePredicateManager]: 89 out of 91 supporting invariants were superfluous and have been removed [2021-12-14 23:26:28,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:28,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 23:26:28,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:28,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 23:26:28,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:28,716 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-14 23:26:28,716 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:28,819 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 9 states. [2021-12-14 23:26:28,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-14 23:26:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2021-12-14 23:26:28,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 59 transitions. Stem has 28 letters. Loop has 3 letters. [2021-12-14 23:26:28,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:28,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 59 transitions. Stem has 31 letters. Loop has 3 letters. [2021-12-14 23:26:28,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:28,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 59 transitions. Stem has 28 letters. Loop has 6 letters. [2021-12-14 23:26:28,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:28,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 237 transitions. [2021-12-14 23:26:28,821 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2021-12-14 23:26:28,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 136 states and 181 transitions. [2021-12-14 23:26:28,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2021-12-14 23:26:28,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-12-14 23:26:28,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 181 transitions. [2021-12-14 23:26:28,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:28,823 INFO L681 BuchiCegarLoop]: Abstraction has 136 states and 181 transitions. [2021-12-14 23:26:28,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 181 transitions. [2021-12-14 23:26:28,827 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 [2021-12-14 23:26:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2021-12-14 23:26:28,831 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) [2021-12-14 23:26:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2021-12-14 23:26:28,832 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2021-12-14 23:26:28,832 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2021-12-14 23:26:28,832 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-14 23:26:28,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 122 transitions. [2021-12-14 23:26:28,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:28,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:28,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:28,836 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:28,836 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:26:28,836 INFO L791 eck$LassoCheckResult]: Stem: 1983#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); 1957#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; 1958#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; 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; 1993#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2008#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; 2007#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2006#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; 2005#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2004#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; 2003#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2002#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; 2001#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2000#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; 1999#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1998#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; 1997#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1996#L90-3 assume !(main_~i~1#1 < 8); 1972#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); 1973#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1965#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; 1966#L66 assume parse_expression_list_#t~switch5#1; 1951#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; 1952#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; 2028#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; 2010#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); 2026#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; 1959#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 1947#L70-8 [2021-12-14 23:26:28,836 INFO L793 eck$LassoCheckResult]: Loop: 1947#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 1963#L70-1 assume !parse_expression_list_#t~short15#1; 1946#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; 1947#L70-8 [2021-12-14 23:26:28,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:28,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 1 times [2021-12-14 23:26:28,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:28,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311534645] [2021-12-14 23:26:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:28,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-14 23:26:28,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:28,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311534645] [2021-12-14 23:26:28,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311534645] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:26:28,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:26:28,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 23:26:28,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548881089] [2021-12-14 23:26:28,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:26:28,944 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:26:28,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:28,944 INFO L85 PathProgramCache]: Analyzing trace with hash 89761, now seen corresponding path program 1 times [2021-12-14 23:26:28,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:28,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358270647] [2021-12-14 23:26:28,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:28,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:28,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:28,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358270647] [2021-12-14 23:26:28,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358270647] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:26:28,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:26:28,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 23:26:28,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525418009] [2021-12-14 23:26:28,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:26:28,950 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:26:28,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:26:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:26:28,950 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) [2021-12-14 23:26:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:28,957 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2021-12-14 23:26:28,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:26:28,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 123 transitions. [2021-12-14 23:26:28,959 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:28,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 122 transitions. [2021-12-14 23:26:28,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-12-14 23:26:28,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-12-14 23:26:28,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 122 transitions. [2021-12-14 23:26:28,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:28,960 INFO L681 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2021-12-14 23:26:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 122 transitions. [2021-12-14 23:26:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-14 23:26:28,962 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) [2021-12-14 23:26:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2021-12-14 23:26:28,962 INFO L704 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2021-12-14 23:26:28,962 INFO L587 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2021-12-14 23:26:28,962 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-14 23:26:28,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 122 transitions. [2021-12-14 23:26:28,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:28,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:28,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:28,963 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:28,963 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:28,963 INFO L791 eck$LassoCheckResult]: Stem: 2176#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); 2149#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; 2150#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; 2184#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2185#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; 2187#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2218#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; 2216#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2213#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; 2211#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2207#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; 2205#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2200#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; 2196#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2192#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; 2191#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2190#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; 2188#L90-3 assume !(main_~i~1#1 < 8); 2163#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); 2164#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2158#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; 2135#L66 assume parse_expression_list_#t~switch5#1; 2138#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; 2145#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; 2203#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; 2197#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); 2193#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; 2151#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2142#L70-8 [2021-12-14 23:26:28,963 INFO L793 eck$LassoCheckResult]: Loop: 2142#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 2156#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; 2182#L70-2 assume parse_expression_list_#t~short14#1; 2171#L70-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 2141#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; 2142#L70-8 [2021-12-14 23:26:28,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:28,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 2 times [2021-12-14 23:26:28,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:28,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145688015] [2021-12-14 23:26:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:28,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-14 23:26:29,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:29,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145688015] [2021-12-14 23:26:29,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145688015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:26:29,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:26:29,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 23:26:29,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743897968] [2021-12-14 23:26:29,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:26:29,098 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:26:29,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 1 times [2021-12-14 23:26:29,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:29,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838170428] [2021-12-14 23:26:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:29,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,103 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:29,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:29,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 23:26:29,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 23:26:29,156 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) [2021-12-14 23:26:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:29,261 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2021-12-14 23:26:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 23:26:29,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 159 transitions. [2021-12-14 23:26:29,262 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-14 23:26:29,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 117 states and 151 transitions. [2021-12-14 23:26:29,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-12-14 23:26:29,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2021-12-14 23:26:29,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 151 transitions. [2021-12-14 23:26:29,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:29,263 INFO L681 BuchiCegarLoop]: Abstraction has 117 states and 151 transitions. [2021-12-14 23:26:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 151 transitions. [2021-12-14 23:26:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2021-12-14 23:26:29,265 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) [2021-12-14 23:26:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2021-12-14 23:26:29,266 INFO L704 BuchiCegarLoop]: Abstraction has 88 states and 116 transitions. [2021-12-14 23:26:29,266 INFO L587 BuchiCegarLoop]: Abstraction has 88 states and 116 transitions. [2021-12-14 23:26:29,266 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-14 23:26:29,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 116 transitions. [2021-12-14 23:26:29,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:29,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:29,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:29,267 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:29,267 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:29,267 INFO L791 eck$LassoCheckResult]: Stem: 2409#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); 2382#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; 2383#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; 2414#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2415#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; 2417#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2430#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; 2429#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2428#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; 2427#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2426#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; 2425#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2424#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; 2423#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2422#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; 2421#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2420#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; 2419#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2418#L90-3 assume !(main_~i~1#1 < 8); 2398#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); 2399#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2391#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; 2370#L66 assume parse_expression_list_#t~switch5#1; 2373#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; 2380#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; 2400#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; 2401#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); 2407#L68 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 2384#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2377#L70-8 [2021-12-14 23:26:29,268 INFO L793 eck$LassoCheckResult]: Loop: 2377#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 2389#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; 2412#L70-2 assume parse_expression_list_#t~short14#1; 2404#L70-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 2376#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; 2377#L70-8 [2021-12-14 23:26:29,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1161473974, now seen corresponding path program 1 times [2021-12-14 23:26:29,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:29,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22217543] [2021-12-14 23:26:29,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:29,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,278 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,287 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:29,288 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 2 times [2021-12-14 23:26:29,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:29,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723885307] [2021-12-14 23:26:29,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:29,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,292 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1035891741, now seen corresponding path program 1 times [2021-12-14 23:26:29,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:29,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878608248] [2021-12-14 23:26:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:29,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-14 23:26:29,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:29,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878608248] [2021-12-14 23:26:29,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878608248] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:26:29,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:26:29,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 23:26:29,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103287285] [2021-12-14 23:26:29,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:26:29,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:29,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 23:26:29,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 23:26:29,376 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) [2021-12-14 23:26:29,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:29,428 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2021-12-14 23:26:29,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 23:26:29,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 172 transitions. [2021-12-14 23:26:29,430 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-14 23:26:29,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 127 states and 164 transitions. [2021-12-14 23:26:29,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-14 23:26:29,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-14 23:26:29,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 164 transitions. [2021-12-14 23:26:29,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:29,431 INFO L681 BuchiCegarLoop]: Abstraction has 127 states and 164 transitions. [2021-12-14 23:26:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 164 transitions. [2021-12-14 23:26:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2021-12-14 23:26:29,433 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) [2021-12-14 23:26:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2021-12-14 23:26:29,433 INFO L704 BuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2021-12-14 23:26:29,433 INFO L587 BuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2021-12-14 23:26:29,433 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-14 23:26:29,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 119 transitions. [2021-12-14 23:26:29,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:29,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:29,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:29,434 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:29,434 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:29,435 INFO L791 eck$LassoCheckResult]: Stem: 2652#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); 2622#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; 2623#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; 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; 2663#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2679#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; 2678#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2677#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; 2676#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2675#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; 2674#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2673#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; 2672#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2671#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; 2670#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2669#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; 2665#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2664#L90-3 assume !(main_~i~1#1 < 8); 2638#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); 2639#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2631#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; 2632#L66 assume !parse_expression_list_#t~switch5#1; 2688#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 2699#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); 2698#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 2691#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; 2687#L66 assume parse_expression_list_#t~switch5#1; 2689#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; 2656#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; 2657#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; 2648#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); 2649#L68 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 2624#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2617#L70-8 [2021-12-14 23:26:29,435 INFO L793 eck$LassoCheckResult]: Loop: 2617#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 2629#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; 2659#L70-2 assume parse_expression_list_#t~short14#1; 2645#L70-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 2616#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; 2617#L70-8 [2021-12-14 23:26:29,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:29,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1836811402, now seen corresponding path program 1 times [2021-12-14 23:26:29,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:29,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140319615] [2021-12-14 23:26:29,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:29,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,445 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,465 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:29,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:29,465 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 3 times [2021-12-14 23:26:29,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:29,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563658500] [2021-12-14 23:26:29,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:29,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,468 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,470 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:29,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:29,471 INFO L85 PathProgramCache]: Analyzing trace with hash 282551409, now seen corresponding path program 1 times [2021-12-14 23:26:29,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:29,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326134027] [2021-12-14 23:26:29,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:29,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-14 23:26:29,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:29,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326134027] [2021-12-14 23:26:29,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326134027] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:26:29,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068558859] [2021-12-14 23:26:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:29,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:26:29,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:29,506 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:26:29,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2021-12-14 23:26:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:29,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:26:29,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-14 23:26:29,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:26:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-14 23:26:29,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068558859] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:26:29,661 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:26:29,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2021-12-14 23:26:29,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268660119] [2021-12-14 23:26:29,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:26:29,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:29,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 23:26:29,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 23:26:29,718 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) [2021-12-14 23:26:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:29,803 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2021-12-14 23:26:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 23:26:29,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 239 transitions. [2021-12-14 23:26:29,805 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-12-14 23:26:29,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 167 states and 217 transitions. [2021-12-14 23:26:29,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-12-14 23:26:29,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-12-14 23:26:29,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 217 transitions. [2021-12-14 23:26:29,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:29,806 INFO L681 BuchiCegarLoop]: Abstraction has 167 states and 217 transitions. [2021-12-14 23:26:29,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 217 transitions. [2021-12-14 23:26:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 132. [2021-12-14 23:26:29,807 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) [2021-12-14 23:26:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 172 transitions. [2021-12-14 23:26:29,808 INFO L704 BuchiCegarLoop]: Abstraction has 132 states and 172 transitions. [2021-12-14 23:26:29,808 INFO L587 BuchiCegarLoop]: Abstraction has 132 states and 172 transitions. [2021-12-14 23:26:29,808 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-14 23:26:29,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 172 transitions. [2021-12-14 23:26:29,808 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-14 23:26:29,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:29,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:29,809 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:29,809 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:29,809 INFO L791 eck$LassoCheckResult]: Stem: 3174#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); 3147#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; 3148#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; 3185#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3186#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; 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; 3201#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3200#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; 3199#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3198#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; 3197#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3196#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; 3195#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3194#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; 3193#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3192#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; 3188#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3187#L90-3 assume !(main_~i~1#1 < 8); 3163#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); 3164#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 3156#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; 3157#L66 assume !parse_expression_list_#t~switch5#1; 3239#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 3238#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); 3237#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 3236#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; 3234#L66 assume !parse_expression_list_#t~switch5#1; 3222#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 3232#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); 3230#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 3223#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; 3221#L66 assume parse_expression_list_#t~switch5#1; 3219#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; 3217#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; 3212#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; 3209#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); 3202#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; 3149#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 3141#L70-8 [2021-12-14 23:26:29,809 INFO L793 eck$LassoCheckResult]: Loop: 3141#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 3154#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; 3178#L70-2 assume parse_expression_list_#t~short14#1; 3168#L70-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 3140#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; 3141#L70-8 [2021-12-14 23:26:29,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:29,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1704815500, now seen corresponding path program 1 times [2021-12-14 23:26:29,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:29,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039417900] [2021-12-14 23:26:29,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:29,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,842 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:29,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:29,846 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 4 times [2021-12-14 23:26:29,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:29,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563015640] [2021-12-14 23:26:29,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:29,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,850 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:29,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:29,850 INFO L85 PathProgramCache]: Analyzing trace with hash 492769819, now seen corresponding path program 1 times [2021-12-14 23:26:29,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:29,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273048928] [2021-12-14 23:26:29,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:29,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,862 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:29,873 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:35,910 WARN L227 SmtUtils]: Spent 5.99s on a formula simplification. DAG size of input: 305 DAG size of output: 214 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-14 23:26:36,495 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:26:36,495 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:26:36,495 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:26:36,495 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:26:36,495 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:26:36,495 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:36,495 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:26:36,495 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:26:36,495 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration12_Lasso [2021-12-14 23:26:36,495 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:26:36,495 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:26:36,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:36,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:37,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:37,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:37,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:37,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:37,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:37,963 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:26:37,963 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:26:37,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:37,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:37,964 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:37,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-14 23:26:37,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:37,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:37,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:37,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:37,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:37,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:37,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:37,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:37,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:37,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:37,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:37,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:37,989 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) [2021-12-14 23:26:37,990 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 [2021-12-14 23:26:37,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:37,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:37,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:37,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:37,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:37,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:37,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:38,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:38,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,016 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-14 23:26:38,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2021-12-14 23:26:38,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,041 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-14 23:26:38,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-12-14 23:26:38,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,066 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-14 23:26:38,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,074 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2021-12-14 23:26:38,089 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,090 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-14 23:26:38,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 [2021-12-14 23:26:38,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:38,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,132 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-14 23:26:38,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:38,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:38,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:38,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,167 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-14 23:26:38,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:38,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,192 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-14 23:26:38,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-12-14 23:26:38,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,216 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-12-14 23:26:38,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:38,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:38,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:38,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,243 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-12-14 23:26:38,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2021-12-14 23:26:38,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,283 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-12-14 23:26:38,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,306 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 [2021-12-14 23:26:38,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,307 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) [2021-12-14 23:26:38,308 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 [2021-12-14 23:26:38,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,332 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 [2021-12-14 23:26:38,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,333 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-12-14 23:26:38,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:38,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,358 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-12-14 23:26:38,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:38,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,383 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-12-14 23:26:38,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2021-12-14 23:26:38,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,407 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-12-14 23:26:38,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-12-14 23:26:38,431 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,431 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-12-14 23:26:38,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:38,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,456 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-12-14 23:26:38,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:38,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:38,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2021-12-14 23:26:38,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,481 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-12-14 23:26:38,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-12-14 23:26:38,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,505 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-12-14 23:26:38,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:38,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,530 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-12-14 23:26:38,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:38,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:38,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:38,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:38,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,555 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-12-14 23:26:38,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:38,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:38,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-12-14 23:26:38,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,582 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-12-14 23:26:38,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:38,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:38,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,606 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 [2021-12-14 23:26:38,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,607 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-12-14 23:26:38,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:38,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:38,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2021-12-14 23:26:38,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,635 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-12-14 23:26:38,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:38,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:38,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2021-12-14 23:26:38,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,661 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-12-14 23:26:38,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:38,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:38,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:38,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:38,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,688 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-12-14 23:26:38,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:38,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:38,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:38,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:38,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:38,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:38,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:38,710 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:26:38,734 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2021-12-14 23:26:38,735 INFO L444 ModelExtractionUtils]: 4 out of 28 variables were initially zero. Simplification set additionally 22 variables to zero. [2021-12-14 23:26:38,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:38,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:38,764 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:38,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-12-14 23:26:38,766 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:26:38,784 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:26:38,784 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:26:38,784 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 [] [2021-12-14 23:26:38,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:38,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:39,055 INFO L297 tatePredicateManager]: 103 out of 103 supporting invariants were superfluous and have been removed [2021-12-14 23:26:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:39,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:26:39,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:39,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 23:26:39,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:39,193 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 [2021-12-14 23:26:39,193 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) [2021-12-14 23:26:39,262 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. [2021-12-14 23:26:39,265 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 [2021-12-14 23:26:39,265 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) [2021-12-14 23:26:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2021-12-14 23:26:39,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 5 letters. [2021-12-14 23:26:39,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:39,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 44 letters. Loop has 5 letters. [2021-12-14 23:26:39,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:39,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 10 letters. [2021-12-14 23:26:39,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:39,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 386 transitions. [2021-12-14 23:26:39,275 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2021-12-14 23:26:39,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 192 states and 251 transitions. [2021-12-14 23:26:39,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-12-14 23:26:39,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-12-14 23:26:39,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 251 transitions. [2021-12-14 23:26:39,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:39,276 INFO L681 BuchiCegarLoop]: Abstraction has 192 states and 251 transitions. [2021-12-14 23:26:39,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 251 transitions. [2021-12-14 23:26:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 138. [2021-12-14 23:26:39,278 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) [2021-12-14 23:26:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2021-12-14 23:26:39,279 INFO L704 BuchiCegarLoop]: Abstraction has 138 states and 179 transitions. [2021-12-14 23:26:39,279 INFO L587 BuchiCegarLoop]: Abstraction has 138 states and 179 transitions. [2021-12-14 23:26:39,279 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-14 23:26:39,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 179 transitions. [2021-12-14 23:26:39,280 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-14 23:26:39,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:39,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:39,280 INFO L842 BuchiCegarLoop]: 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] [2021-12-14 23:26:39,280 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:26:39,281 INFO L791 eck$LassoCheckResult]: Stem: 4174#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); 4146#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; 4147#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; 4183#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4184#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; 4185#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4198#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; 4197#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4196#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; 4195#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4194#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; 4193#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4192#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; 4191#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4190#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; 4189#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4188#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; 4187#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4186#L90-3 assume !(main_~i~1#1 < 8); 4160#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); 4161#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 4155#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; 4156#L66 assume parse_expression_list_#t~switch5#1; 4230#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; 4229#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; 4228#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; 4227#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); 4226#L68 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 4225#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 4224#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 4223#L70-1 assume !parse_expression_list_#t~short15#1; 4222#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; 4221#L70-9 parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; 4220#L71 assume !parse_expression_list_#t~short18#1; 4219#L71-2 assume !parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1; 4218#L71-4 assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; 4217#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; 4216#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; 4215#L15 assume !(0 == __VERIFIER_assert_~cond#1); 4214#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); 4213#L72 parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1; 4212#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 4211#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); 4210#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 4209#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; 4207#L66 assume parse_expression_list_#t~switch5#1; 4168#L67-5 [2021-12-14 23:26:39,281 INFO L793 eck$LassoCheckResult]: Loop: 4168#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; 4178#L67-1 assume parse_expression_list_#t~short8#1; 4167#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; 4168#L67-5 [2021-12-14 23:26:39,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:39,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1896680144, now seen corresponding path program 1 times [2021-12-14 23:26:39,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:39,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234270760] [2021-12-14 23:26:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:39,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-14 23:26:39,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:39,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234270760] [2021-12-14 23:26:39,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234270760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:26:39,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:26:39,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 23:26:39,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381146155] [2021-12-14 23:26:39,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:26:39,320 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:26:39,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:39,321 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 3 times [2021-12-14 23:26:39,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:39,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418041465] [2021-12-14 23:26:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:39,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:39,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:39,325 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:39,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:39,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 23:26:39,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 23:26:39,357 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) [2021-12-14 23:26:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:39,417 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2021-12-14 23:26:39,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 23:26:39,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 182 transitions. [2021-12-14 23:26:39,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:39,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 127 states and 167 transitions. [2021-12-14 23:26:39,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-14 23:26:39,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-14 23:26:39,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 167 transitions. [2021-12-14 23:26:39,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:39,420 INFO L681 BuchiCegarLoop]: Abstraction has 127 states and 167 transitions. [2021-12-14 23:26:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 167 transitions. [2021-12-14 23:26:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2021-12-14 23:26:39,421 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) [2021-12-14 23:26:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2021-12-14 23:26:39,421 INFO L704 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2021-12-14 23:26:39,422 INFO L587 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2021-12-14 23:26:39,422 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-14 23:26:39,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 139 transitions. [2021-12-14 23:26:39,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:39,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:39,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:39,423 INFO L842 BuchiCegarLoop]: 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] [2021-12-14 23:26:39,423 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:26:39,423 INFO L791 eck$LassoCheckResult]: Stem: 4464#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); 4437#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; 4438#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; 4472#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; 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; 4511#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; 4509#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4507#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; 4505#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4498#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; 4497#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4496#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; 4495#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4494#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; 4492#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4490#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; 4487#L90-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4486#L90-3 assume !(main_~i~1#1 < 8); 4453#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); 4454#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 4446#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; 4424#L66 assume !parse_expression_list_#t~switch5#1; 4425#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 4449#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); 4450#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 4530#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; 4529#L66 assume parse_expression_list_#t~switch5#1; 4525#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; 4524#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; 4522#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; 4520#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); 4518#L68 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 4440#L68-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 4441#L70-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 4445#L70-1 assume !parse_expression_list_#t~short15#1; 4471#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; 4482#L70-9 parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; 4480#L71 assume !parse_expression_list_#t~short18#1; 4479#L71-2 assume !parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1; 4451#L71-4 assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; 4452#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; 4468#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; 4466#L15 assume !(0 == __VERIFIER_assert_~cond#1); 4442#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); 4443#L72 parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1; 4474#L65 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 4503#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); 4502#L63-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 4501#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; 4499#L66 assume parse_expression_list_#t~switch5#1; 4432#L67-5 [2021-12-14 23:26:39,423 INFO L793 eck$LassoCheckResult]: Loop: 4432#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; 4433#L67-1 assume parse_expression_list_#t~short8#1; 4455#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; 4432#L67-5 [2021-12-14 23:26:39,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:39,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1759377532, now seen corresponding path program 1 times [2021-12-14 23:26:39,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:39,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755671326] [2021-12-14 23:26:39,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:39,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-14 23:26:39,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:39,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755671326] [2021-12-14 23:26:39,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755671326] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:26:39,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127430740] [2021-12-14 23:26:39,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:39,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:26:39,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:39,502 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:26:39,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2021-12-14 23:26:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:39,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 23:26:39,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:39,599 INFO L388 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 [2021-12-14 23:26:39,631 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 23:26:39,632 INFO L388 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 [2021-12-14 23:26:39,723 INFO L388 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 [2021-12-14 23:26:39,737 INFO L388 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 [2021-12-14 23:26:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-14 23:26:39,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:26:39,754 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_532 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_parse_expression_list_~#str2~0#1.base| v_ArrVal_532) |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 [2021-12-14 23:26:39,817 INFO L388 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 [2021-12-14 23:26:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-14 23:26:39,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127430740] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:26:39,860 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:26:39,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2021-12-14 23:26:39,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381409700] [2021-12-14 23:26:39,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:26:39,861 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:26:39,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 4 times [2021-12-14 23:26:39,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:39,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495686126] [2021-12-14 23:26:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:39,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:39,864 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:39,866 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:39,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:39,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 23:26:39,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=82, Unknown=1, NotChecked=18, Total=132 [2021-12-14 23:26:39,906 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. cyclomatic complexity: 40 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) [2021-12-14 23:26:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:40,009 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2021-12-14 23:26:40,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 23:26:40,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 106 transitions. [2021-12-14 23:26:40,010 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-14 23:26:40,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2021-12-14 23:26:40,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-14 23:26:40,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-14 23:26:40,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-14 23:26:40,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:26:40,011 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:26:40,011 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:26:40,011 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:26:40,011 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-14 23:26:40,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-14 23:26:40,011 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-14 23:26:40,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-14 23:26:40,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.12 11:26:40 BoogieIcfgContainer [2021-12-14 23:26:40,016 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-14 23:26:40,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 23:26:40,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 23:26:40,016 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 23:26:40,017 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:26:11" (3/4) ... [2021-12-14 23:26:40,019 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 23:26:40,019 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 23:26:40,019 INFO L158 Benchmark]: Toolchain (without parser) took 28899.73ms. Allocated memory was 92.3MB in the beginning and 163.6MB in the end (delta: 71.3MB). Free memory was 60.6MB in the beginning and 51.0MB in the end (delta: 9.6MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. [2021-12-14 23:26:40,020 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory was 48.6MB in the beginning and 48.6MB in the end (delta: 12.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:26:40,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.09ms. Allocated memory is still 92.3MB. Free memory was 60.4MB in the beginning and 66.6MB in the end (delta: -6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-14 23:26:40,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.48ms. Allocated memory is still 92.3MB. Free memory was 66.6MB in the beginning and 64.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:26:40,020 INFO L158 Benchmark]: Boogie Preprocessor took 25.51ms. Allocated memory is still 92.3MB. Free memory was 64.5MB in the beginning and 62.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:26:40,020 INFO L158 Benchmark]: RCFGBuilder took 285.31ms. Allocated memory is still 92.3MB. Free memory was 62.9MB in the beginning and 49.7MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-14 23:26:40,021 INFO L158 Benchmark]: BuchiAutomizer took 28343.27ms. Allocated memory was 92.3MB in the beginning and 163.6MB in the end (delta: 71.3MB). Free memory was 49.7MB in the beginning and 51.0MB in the end (delta: -1.2MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2021-12-14 23:26:40,021 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 163.6MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:26:40,022 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.16ms. Allocated memory is still 92.3MB. Free memory was 48.6MB in the beginning and 48.6MB in the end (delta: 12.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.09ms. Allocated memory is still 92.3MB. Free memory was 60.4MB in the beginning and 66.6MB in the end (delta: -6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.48ms. Allocated memory is still 92.3MB. Free memory was 66.6MB in the beginning and 64.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.51ms. Allocated memory is still 92.3MB. Free memory was 64.5MB in the beginning and 62.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 285.31ms. Allocated memory is still 92.3MB. Free memory was 62.9MB in the beginning and 49.7MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 28343.27ms. Allocated memory was 92.3MB in the beginning and 163.6MB in the end (delta: 71.3MB). Free memory was 49.7MB in the beginning and 51.0MB in the end (delta: -1.2MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 163.6MB. Free memory is still 51.0MB. 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 14 terminating modules (10 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[A] + -1 * start and consists of 6 locations. One deterministic module has affine ranking function j and consists of 6 locations. 10 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.2s and 15 iterations. TraceHistogramMax:8. Analysis of lassos took 26.6s. Construction of modules took 0.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 246 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 138 states and ocurred in iteration 12. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 701 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 698 mSDsluCounter, 1565 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 32 IncrementalHoareTripleChecker+Unchecked, 1072 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 728 IncrementalHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 493 mSDtfsCounter, 728 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU6 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf99 lsp93 ukn85 mio100 lsp32 div100 bol100 ite100 ukn100 eq181 hnf90 smp98 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-14 23:26:40,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2021-12-14 23:26:40,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2021-12-14 23:26:40,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-14 23:26:40,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-14 23:26:40,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE