./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/string-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/string-2.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 fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:10:25,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:10:25,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:10:25,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:10:25,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:10:25,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:10:25,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:10:25,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:10:25,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:10:25,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:10:25,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:10:25,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:10:25,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:10:25,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:10:25,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:10:25,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:10:25,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:10:25,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:10:25,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:10:25,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:10:25,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:10:25,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:10:25,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:10:25,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:10:25,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:10:25,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:10:25,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:10:25,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:10:25,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:10:25,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:10:25,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:10:25,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:10:25,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:10:25,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:10:25,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:10:25,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:10:25,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:10:25,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:10:25,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:10:25,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:10:25,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:10:25,480 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:10:25,503 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:10:25,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:10:25,504 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:10:25,504 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:10:25,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:10:25,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:10:25,505 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:10:25,505 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:10:25,506 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:10:25,506 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:10:25,506 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:10:25,506 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:10:25,506 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:10:25,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:10:25,507 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:10:25,507 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:10:25,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:10:25,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:10:25,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:10:25,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:10:25,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:10:25,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:10:25,508 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:10:25,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:10:25,509 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:10:25,509 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:10:25,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:10:25,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:10:25,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:10:25,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:10:25,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:10:25,510 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:10:25,511 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:10:25,511 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 -> fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 [2021-12-15 17:10:25,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:10:25,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:10:25,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:10:25,731 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:10:25,733 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:10:25,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2021-12-15 17:10:25,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de0f2661d/83d9e2d9685447f19ba79da359c841b3/FLAGe15b21e30 [2021-12-15 17:10:26,129 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:10:26,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2021-12-15 17:10:26,135 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de0f2661d/83d9e2d9685447f19ba79da359c841b3/FLAGe15b21e30 [2021-12-15 17:10:26,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de0f2661d/83d9e2d9685447f19ba79da359c841b3 [2021-12-15 17:10:26,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:10:26,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:10:26,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:10:26,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:10:26,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:10:26,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:10:26" (1/1) ... [2021-12-15 17:10:26,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259d4e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:10:26, skipping insertion in model container [2021-12-15 17:10:26,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:10:26" (1/1) ... [2021-12-15 17:10:26,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:10:26,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:10:26,708 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/string-2.i[896,909] [2021-12-15 17:10:26,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:10:26,730 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:10:26,740 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/string-2.i[896,909] [2021-12-15 17:10:26,751 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:10:26,764 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:10:26,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:10:26 WrapperNode [2021-12-15 17:10:26,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:10:26,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:10:26,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:10:26,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:10:26,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:10:26" (1/1) ... [2021-12-15 17:10:26,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:10:26" (1/1) ... [2021-12-15 17:10:26,807 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2021-12-15 17:10:26,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:10:26,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:10:26,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:10:26,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:10:26,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:10:26" (1/1) ... [2021-12-15 17:10:26,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:10:26" (1/1) ... [2021-12-15 17:10:26,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:10:26" (1/1) ... [2021-12-15 17:10:26,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:10:26" (1/1) ... [2021-12-15 17:10:26,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:10:26" (1/1) ... [2021-12-15 17:10:26,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:10:26" (1/1) ... [2021-12-15 17:10:26,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:10:26" (1/1) ... [2021-12-15 17:10:26,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:10:26,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:10:26,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:10:26,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:10:26,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:10:26" (1/1) ... [2021-12-15 17:10:26,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:26,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:26,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:26,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:10:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:10:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:10:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:10:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:10:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:10:26,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:10:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:10:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:10:26,954 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:10:26,955 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:10:27,080 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:10:27,086 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:10:27,086 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-15 17:10:27,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:10:27 BoogieIcfgContainer [2021-12-15 17:10:27,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:10:27,089 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:10:27,089 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:10:27,093 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:10:27,094 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:10:27,094 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:10:26" (1/3) ... [2021-12-15 17:10:27,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29bbe1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:10:27, skipping insertion in model container [2021-12-15 17:10:27,096 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:10:27,096 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:10:26" (2/3) ... [2021-12-15 17:10:27,096 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29bbe1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:10:27, skipping insertion in model container [2021-12-15 17:10:27,096 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:10:27,097 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:10:27" (3/3) ... [2021-12-15 17:10:27,098 INFO L388 chiAutomizerObserver]: Analyzing ICFG string-2.i [2021-12-15 17:10:27,134 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:10:27,134 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:10:27,134 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:10:27,134 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:10:27,135 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:10:27,135 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:10:27,135 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:10:27,135 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:10:27,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:27,165 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2021-12-15 17:10:27,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:27,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:27,173 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:10:27,173 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:10:27,173 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:10:27,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:27,175 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2021-12-15 17:10:27,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:27,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:27,176 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:10:27,176 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:10:27,182 INFO L791 eck$LassoCheckResult]: Stem: 15#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(11, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 8#L35-3true [2021-12-15 17:10:27,182 INFO L793 eck$LassoCheckResult]: Loop: 8#L35-3true assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 10#L35-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 8#L35-3true [2021-12-15 17:10:27,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:27,188 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:10:27,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:27,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624469789] [2021-12-15 17:10:27,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:27,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:27,297 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:27,344 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:27,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-12-15 17:10:27,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:27,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440537050] [2021-12-15 17:10:27,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:27,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:27,368 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:27,384 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:27,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-15 17:10:27,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:27,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184250639] [2021-12-15 17:10:27,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:27,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:27,432 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:27,446 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:27,873 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:10:27,873 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:10:27,874 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:10:27,874 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:10:27,874 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:10:27,874 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:27,875 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:10:27,875 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:10:27,875 INFO L133 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration1_Lasso [2021-12-15 17:10:27,875 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:10:27,876 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:10:27,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:27,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:27,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:27,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-15 17:10:27,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:27,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:27,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:27,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:27,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:27,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:27,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-15 17:10:27,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:27,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:28,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:28,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:28,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:28,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:28,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:28,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:28,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:28,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:28,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:28,465 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:10:28,469 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:10:28,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:28,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:28,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:28,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-15 17:10:28,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:28,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:28,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:28,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:28,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:28,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:28,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:28,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:28,493 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:28,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-15 17:10:28,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:28,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:28,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:28,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-15 17:10:28,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:28,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:28,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:28,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:28,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:28,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:28,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:28,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:28,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-15 17:10:28,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:28,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:28,594 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:28,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-15 17:10:28,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:28,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:28,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:28,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:28,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:28,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:28,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:28,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:28,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:28,622 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-15 17:10:28,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:28,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:28,624 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:28,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-15 17:10:28,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:28,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:28,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:28,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:28,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:28,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:28,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:28,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:28,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:28,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:28,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:28,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:28,653 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:28,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-15 17:10:28,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:28,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:28,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:28,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:28,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:28,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:28,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:28,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:28,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:28,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:28,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:28,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:28,718 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:28,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-15 17:10:28,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:28,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:28,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:28,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:28,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:28,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:28,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:28,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:28,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:28,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:28,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:28,779 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:28,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-15 17:10:28,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:28,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:28,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:28,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:28,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:28,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:28,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:28,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:28,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:28,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:28,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:28,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:28,808 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:28,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-15 17:10:28,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:28,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:28,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:28,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:28,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:28,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:28,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:28,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:28,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:28,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:28,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:28,852 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:28,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-15 17:10:28,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:28,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:28,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:28,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:28,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:28,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:28,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:28,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:28,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:28,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-12-15 17:10:28,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:28,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:28,878 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:28,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:28,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:28,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:28,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:28,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:28,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:28,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:28,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:28,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-15 17:10:28,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:28,915 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-15 17:10:28,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:28,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:28,919 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:28,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-15 17:10:28,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:28,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:28,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:28,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:28,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:28,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:28,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:28,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:28,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:28,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-12-15 17:10:28,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:28,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:28,956 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:28,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-15 17:10:28,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:28,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:28,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:28,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:28,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:28,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:28,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:28,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:28,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:28,980 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-15 17:10:28,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:28,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:28,981 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:28,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-15 17:10:28,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:28,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:28,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:28,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:28,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:28,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:28,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:29,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:29,045 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-15 17:10:29,045 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:29,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:29,046 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:29,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-15 17:10:29,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:29,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:29,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:29,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:29,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:29,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:29,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:29,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:29,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:29,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:29,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:29,093 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:29,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-15 17:10:29,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:29,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:29,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:29,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:29,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:29,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:29,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:29,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:29,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-12-15 17:10:29,121 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:29,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:29,122 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:29,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-15 17:10:29,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:29,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:29,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:29,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:29,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:29,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:29,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:29,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:29,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-12-15 17:10:29,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:29,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:29,177 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:29,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-15 17:10:29,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:29,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:29,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:29,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:29,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:29,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:29,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:29,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:29,225 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-15 17:10:29,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:29,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:29,226 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:29,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:29,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:29,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:29,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:29,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:29,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:29,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:29,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-15 17:10:29,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:29,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:29,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:29,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:29,281 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:29,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:29,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-15 17:10:29,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:29,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:29,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:29,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:29,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:29,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:29,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:29,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:29,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:29,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:29,347 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:29,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-15 17:10:29,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:29,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:29,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:29,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:29,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:29,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:29,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:29,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:29,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:29,405 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:29,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:29,407 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:29,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:29,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:29,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:29,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:29,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:29,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:29,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:29,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-15 17:10:29,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:29,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-15 17:10:29,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:29,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:29,461 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:29,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-15 17:10:29,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:29,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:29,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:29,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:29,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:29,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:29,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:29,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:29,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-15 17:10:29,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:29,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:29,504 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:29,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-15 17:10:29,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:29,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:29,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:29,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:29,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:29,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:29,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:29,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:29,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:29,530 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-15 17:10:29,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:29,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:29,531 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:29,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-15 17:10:29,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:29,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:29,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:29,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:29,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:29,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:29,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:29,552 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:10:29,572 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-12-15 17:10:29,573 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-15 17:10:29,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:29,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:29,575 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:29,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-15 17:10:29,578 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:10:29,612 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:10:29,613 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:10:29,613 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 9*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_1 - 2*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-15 17:10:29,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:29,659 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2021-12-15 17:10:29,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:29,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:10:29,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:29,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 17:10:29,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:10:29,771 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:10:29,772 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-15 17:10:29,838 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 50 states and 80 transitions. Complement of second has 8 states. [2021-12-15 17:10:29,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:10:29,843 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-15 17:10:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2021-12-15 17:10:29,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-15 17:10:29,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:29,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-15 17:10:29,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:29,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-15 17:10:29,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:29,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 80 transitions. [2021-12-15 17:10:29,851 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-15 17:10:29,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 19 states and 28 transitions. [2021-12-15 17:10:29,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-15 17:10:29,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-15 17:10:29,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2021-12-15 17:10:29,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:10:29,856 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2021-12-15 17:10:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2021-12-15 17:10:29,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-15 17:10:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2021-12-15 17:10:29,879 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2021-12-15 17:10:29,879 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2021-12-15 17:10:29,879 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:10:29,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2021-12-15 17:10:29,880 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-15 17:10:29,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:29,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:29,880 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-15 17:10:29,880 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:10:29,880 INFO L791 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); 153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 161#L35-3 assume !(main_~i~0#1 < 5); 158#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 159#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 149#L39-3 [2021-12-15 17:10:29,881 INFO L793 eck$LassoCheckResult]: Loop: 149#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 151#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 149#L39-3 [2021-12-15 17:10:29,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2021-12-15 17:10:29,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:29,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794790651] [2021-12-15 17:10:29,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:29,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:10:29,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:10:29,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794790651] [2021-12-15 17:10:29,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794790651] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:10:29,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:10:29,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:10:29,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286938658] [2021-12-15 17:10:29,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:10:29,923 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:10:29,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:29,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2021-12-15 17:10:29,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:29,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157283337] [2021-12-15 17:10:29,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:29,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:29,933 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:29,940 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:29,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:10:29,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:10:29,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:10:29,978 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 14 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-15 17:10:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:10:30,007 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2021-12-15 17:10:30,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:10:30,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2021-12-15 17:10:30,010 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-15 17:10:30,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2021-12-15 17:10:30,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-15 17:10:30,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-15 17:10:30,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2021-12-15 17:10:30,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:10:30,012 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2021-12-15 17:10:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2021-12-15 17:10:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2021-12-15 17:10:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 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-15 17:10:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2021-12-15 17:10:30,015 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-12-15 17:10:30,015 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-12-15 17:10:30,016 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:10:30,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2021-12-15 17:10:30,016 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-15 17:10:30,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:30,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:30,017 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:10:30,017 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:10:30,017 INFO L791 eck$LassoCheckResult]: Stem: 200#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(11, 2); 201#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 209#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 210#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 211#L35-3 assume !(main_~i~0#1 < 5); 206#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 207#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 196#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 197#L39-2 [2021-12-15 17:10:30,017 INFO L793 eck$LassoCheckResult]: Loop: 197#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 213#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 197#L39-2 [2021-12-15 17:10:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:30,018 INFO L85 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2021-12-15 17:10:30,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:30,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905988459] [2021-12-15 17:10:30,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:30,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:30,091 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-15 17:10:30,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:10:30,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905988459] [2021-12-15 17:10:30,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905988459] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:10:30,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:30,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175267689] [2021-12-15 17:10:30,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:30,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:10:30,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:30,098 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:10:30,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-15 17:10:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:30,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 17:10:30,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:30,162 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-15 17:10:30,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:10:30,187 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-15 17:10:30,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175267689] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:10:30,187 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:10:30,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-15 17:10:30,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196645063] [2021-12-15 17:10:30,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:10:30,188 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:10:30,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:30,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2021-12-15 17:10:30,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:30,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952643816] [2021-12-15 17:10:30,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:30,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:30,194 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:30,199 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:30,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:10:30,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 17:10:30,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-15 17:10:30,233 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 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-15 17:10:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:10:30,291 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2021-12-15 17:10:30,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:10:30,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2021-12-15 17:10:30,293 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-15 17:10:30,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2021-12-15 17:10:30,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-12-15 17:10:30,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-12-15 17:10:30,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2021-12-15 17:10:30,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:10:30,295 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-12-15 17:10:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2021-12-15 17:10:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2021-12-15 17:10:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2021-12-15 17:10:30,297 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2021-12-15 17:10:30,297 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2021-12-15 17:10:30,297 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:10:30,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2021-12-15 17:10:30,298 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-15 17:10:30,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:30,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:30,299 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2021-12-15 17:10:30,299 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:10:30,299 INFO L791 eck$LassoCheckResult]: Stem: 312#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(11, 2); 313#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 321#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 322#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 323#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 324#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 339#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 338#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 337#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 336#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 335#L35-3 assume !(main_~i~0#1 < 5); 318#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 319#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 308#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 309#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 326#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 334#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 333#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 332#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 331#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 330#L39-2 [2021-12-15 17:10:30,299 INFO L793 eck$LassoCheckResult]: Loop: 330#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 329#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 330#L39-2 [2021-12-15 17:10:30,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:30,300 INFO L85 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 1 times [2021-12-15 17:10:30,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:30,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191682221] [2021-12-15 17:10:30,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:30,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 17:10:30,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:10:30,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191682221] [2021-12-15 17:10:30,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191682221] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:10:30,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162956429] [2021-12-15 17:10:30,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:30,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:10:30,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:30,364 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:10:30,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-15 17:10:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:30,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 17:10:30,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 17:10:30,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:10:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 17:10:30,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162956429] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:10:30,523 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:10:30,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2021-12-15 17:10:30,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068376734] [2021-12-15 17:10:30,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:10:30,524 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:10:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:30,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2021-12-15 17:10:30,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:30,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72944780] [2021-12-15 17:10:30,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:30,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:30,528 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:30,532 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:30,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:10:30,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 17:10:30,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-15 17:10:30,564 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 10 Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:10:30,630 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2021-12-15 17:10:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 17:10:30,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2021-12-15 17:10:30,632 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-15 17:10:30,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2021-12-15 17:10:30,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-12-15 17:10:30,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-12-15 17:10:30,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2021-12-15 17:10:30,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:10:30,640 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-12-15 17:10:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2021-12-15 17:10:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2021-12-15 17:10:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-12-15 17:10:30,647 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-12-15 17:10:30,647 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-12-15 17:10:30,647 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:10:30,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2021-12-15 17:10:30,649 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-15 17:10:30,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:30,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:30,650 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2021-12-15 17:10:30,651 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:10:30,651 INFO L791 eck$LassoCheckResult]: Stem: 515#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(11, 2); 516#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 524#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 525#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 526#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 527#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 546#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 545#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 544#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 543#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 542#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 541#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 540#L35-3 assume !(main_~i~0#1 < 5); 521#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 522#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 528#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 530#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 511#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 512#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 539#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 538#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 537#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 536#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 535#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 534#L39-2 [2021-12-15 17:10:30,651 INFO L793 eck$LassoCheckResult]: Loop: 534#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 533#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 534#L39-2 [2021-12-15 17:10:30,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:30,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 2 times [2021-12-15 17:10:30,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:30,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228560517] [2021-12-15 17:10:30,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:30,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:30,699 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:30,745 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:30,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:30,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2021-12-15 17:10:30,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:30,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951719608] [2021-12-15 17:10:30,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:30,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:30,760 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:30,769 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:30,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:30,770 INFO L85 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 3 times [2021-12-15 17:10:30,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:30,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702670207] [2021-12-15 17:10:30,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:30,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-15 17:10:30,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:10:30,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702670207] [2021-12-15 17:10:30,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702670207] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:10:30,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124541650] [2021-12-15 17:10:30,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 17:10:30,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:10:30,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:30,880 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:10:30,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-12-15 17:10:30,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-15 17:10:30,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:10:30,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 17:10:30,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-15 17:10:31,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 17:10:31,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124541650] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:10:31,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 17:10:31,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2021-12-15 17:10:31,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127148641] [2021-12-15 17:10:31,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:10:31,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:10:31,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 17:10:31,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-12-15 17:10:31,055 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:10:31,148 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2021-12-15 17:10:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 17:10:31,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 57 transitions. [2021-12-15 17:10:31,150 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-15 17:10:31,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 57 transitions. [2021-12-15 17:10:31,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-12-15 17:10:31,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2021-12-15 17:10:31,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 57 transitions. [2021-12-15 17:10:31,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:10:31,151 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 57 transitions. [2021-12-15 17:10:31,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 57 transitions. [2021-12-15 17:10:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2021-12-15 17:10:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2021-12-15 17:10:31,154 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2021-12-15 17:10:31,154 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2021-12-15 17:10:31,154 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:10:31,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 39 transitions. [2021-12-15 17:10:31,155 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-12-15 17:10:31,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:31,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:31,156 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:10:31,156 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:10:31,156 INFO L791 eck$LassoCheckResult]: Stem: 688#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(11, 2); 689#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 697#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 698#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 702#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 719#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 718#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 717#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 716#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 715#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 714#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 713#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 711#L35-3 assume !(main_~i~0#1 < 5); 694#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 695#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 684#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 685#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 700#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 712#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 710#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 709#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 708#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 707#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 706#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 705#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 704#L39-3 assume !(main_~i~0#1 < 5); 703#L39-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 699#L41 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 690#L44-3 [2021-12-15 17:10:31,156 INFO L793 eck$LassoCheckResult]: Loop: 690#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 691#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 690#L44-3 [2021-12-15 17:10:31,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:31,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2021-12-15 17:10:31,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:31,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628221190] [2021-12-15 17:10:31,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:31,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:31,175 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:31,192 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:31,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:31,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2021-12-15 17:10:31,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:31,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528458445] [2021-12-15 17:10:31,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:31,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:31,197 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:31,200 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:31,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:31,200 INFO L85 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2021-12-15 17:10:31,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:31,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16107689] [2021-12-15 17:10:31,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:31,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:31,218 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:31,236 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:35,310 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:10:35,310 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:10:35,310 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:10:35,310 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:10:35,310 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:10:35,310 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:35,310 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:10:35,310 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:10:35,310 INFO L133 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration6_Lasso [2021-12-15 17:10:35,310 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:10:35,310 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:10:35,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:35,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:35,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:35,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:35,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:35,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-15 17:10:36,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:36,454 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:10:36,454 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:10:36,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:36,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:36,457 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:36,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-15 17:10:36,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:36,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:36,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:36,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:36,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:36,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:36,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:36,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:36,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:36,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-15 17:10:36,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:36,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:36,483 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:36,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:36,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:36,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:36,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:36,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:36,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:36,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:36,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-15 17:10:36,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:36,544 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-15 17:10:36,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:36,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:36,546 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:36,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-15 17:10:36,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:36,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:36,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:36,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:36,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:36,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:36,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:36,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:36,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:36,583 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-15 17:10:36,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:36,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:36,584 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:36,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-15 17:10:36,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:36,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:36,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:36,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:36,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:36,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:36,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:36,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:36,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:36,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:36,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:36,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:36,612 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:36,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-15 17:10:36,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-15 17:10:36,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:36,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:36,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:36,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:36,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:36,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:36,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:36,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:36,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:36,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:36,642 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-15 17:10:36,643 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-15 17:10:36,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:36,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:36,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:36,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:36,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:36,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:36,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:36,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:36,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:36,666 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-15 17:10:36,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:36,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:36,667 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:36,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-15 17:10:36,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:36,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:36,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:36,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:36,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:36,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:36,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:36,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:36,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:36,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:36,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:36,731 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:36,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-15 17:10:36,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:36,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:36,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:36,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:36,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:36,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:36,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:36,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:36,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-12-15 17:10:36,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:36,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:36,774 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:36,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-15 17:10:36,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:36,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:36,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:36,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:36,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:36,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:36,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:36,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:36,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-12-15 17:10:36,801 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:36,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:36,801 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:36,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-15 17:10:36,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:36,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:36,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:36,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:36,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:36,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:36,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:36,813 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:36,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-12-15 17:10:36,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:36,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:36,830 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:36,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-15 17:10:36,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:36,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:36,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:36,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:36,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:36,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:36,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:36,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:36,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:36,884 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:36,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:36,885 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:36,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:36,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:36,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:36,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:36,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:36,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:36,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:36,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-15 17:10:36,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:36,933 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-15 17:10:36,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:36,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:36,935 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:36,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-15 17:10:36,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:36,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:36,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:36,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:36,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:36,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:36,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:36,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:36,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:36,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:36,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:36,964 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:36,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-15 17:10:36,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:36,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:36,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:36,972 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-15 17:10:36,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:36,976 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-12-15 17:10:36,976 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-15 17:10:36,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:37,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-15 17:10:37,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:37,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:37,006 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:37,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-15 17:10:37,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:37,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:37,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:37,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:37,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:37,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:37,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:37,025 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:10:37,036 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-15 17:10:37,036 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-15 17:10:37,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:37,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:37,041 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:37,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-15 17:10:37,044 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:10:37,056 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:10:37,056 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:10:37,056 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_2, ULTIMATE.start_main_~nc_A~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_2 - 1*ULTIMATE.start_main_~nc_A~0#1 Supporting invariants [] [2021-12-15 17:10:37,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:37,230 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-15 17:10:37,267 INFO L297 tatePredicateManager]: 64 out of 65 supporting invariants were superfluous and have been removed [2021-12-15 17:10:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:37,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:10:37,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:37,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 17:10:37,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:10:37,571 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-15 17:10:37,571 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 39 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-15 17:10:37,605 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 39 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Result 44 states and 51 transitions. Complement of second has 5 states. [2021-12-15 17:10:37,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-15 17:10:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-15 17:10:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2021-12-15 17:10:37,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 28 letters. Loop has 2 letters. [2021-12-15 17:10:37,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:37,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 30 letters. Loop has 2 letters. [2021-12-15 17:10:37,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:37,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 28 letters. Loop has 4 letters. [2021-12-15 17:10:37,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:37,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 51 transitions. [2021-12-15 17:10:37,609 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-15 17:10:37,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 42 transitions. [2021-12-15 17:10:37,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-12-15 17:10:37,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-12-15 17:10:37,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 42 transitions. [2021-12-15 17:10:37,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:10:37,610 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-12-15 17:10:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 42 transitions. [2021-12-15 17:10:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-15 17:10:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 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-15 17:10:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-12-15 17:10:37,612 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-12-15 17:10:37,612 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-12-15 17:10:37,612 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:10:37,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2021-12-15 17:10:37,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-15 17:10:37,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:37,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:37,614 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:10:37,614 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:10:37,614 INFO L791 eck$LassoCheckResult]: Stem: 1145#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(11, 2); 1146#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 1156#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1162#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1157#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1158#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1178#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1177#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1176#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1175#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1174#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1173#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1172#L35-3 assume !(main_~i~0#1 < 5); 1153#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 1154#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 1141#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1142#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1160#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1171#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1170#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1169#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1168#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1167#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1166#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1165#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1164#L39-3 assume !(main_~i~0#1 < 5); 1163#L39-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 1159#L41 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 1147#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 1149#L44-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 1151#L44-4 main_~nc_B~0#1 := 0; 1152#L48-3 [2021-12-15 17:10:37,614 INFO L793 eck$LassoCheckResult]: Loop: 1152#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 1161#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1152#L48-3 [2021-12-15 17:10:37,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:37,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1793218173, now seen corresponding path program 1 times [2021-12-15 17:10:37,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:37,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689754352] [2021-12-15 17:10:37,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:37,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:37,631 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:37,646 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:37,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:37,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2854, now seen corresponding path program 1 times [2021-12-15 17:10:37,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:37,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501679194] [2021-12-15 17:10:37,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:37,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:37,649 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:37,652 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:37,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:37,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1000780450, now seen corresponding path program 1 times [2021-12-15 17:10:37,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:37,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052785804] [2021-12-15 17:10:37,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:37,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:37,667 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:37,681 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:42,419 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:10:42,419 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:10:42,419 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:10:42,419 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:10:42,419 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:10:42,419 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:42,419 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:10:42,419 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:10:42,419 INFO L133 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration7_Lasso [2021-12-15 17:10:42,419 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:10:42,419 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:10:42,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:42,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:42,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:42,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:42,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:43,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:43,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-15 17:10:43,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:43,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:43,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:43,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:43,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:43,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:43,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-15 17:10:43,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-15 17:10:43,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:43,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:43,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:43,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:43,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-15 17:10:43,863 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:10:43,864 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:10:43,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:43,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:43,866 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:43,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-15 17:10:43,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:43,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:43,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:43,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:43,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:43,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:43,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:43,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:43,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:43,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:43,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:43,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:43,915 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:43,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:43,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-15 17:10:43,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:43,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:43,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:43,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:43,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:43,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:43,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:43,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:43,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:43,943 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:43,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:43,943 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:43,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-15 17:10:43,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:43,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:43,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:43,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:43,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:43,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:43,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:43,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:43,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-15 17:10:43,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:43,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:43,972 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:43,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-15 17:10:43,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-15 17:10:43,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:43,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:43,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:43,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:43,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:43,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:43,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:43,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:43,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-12-15 17:10:43,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:43,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:43,999 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:44,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-15 17:10:44,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:44,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:44,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:44,007 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-15 17:10:44,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:44,011 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-12-15 17:10:44,011 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-15 17:10:44,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:44,054 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-15 17:10:44,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:44,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:44,055 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:44,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-15 17:10:44,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:44,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:44,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:44,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:44,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:44,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:44,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:44,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:44,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-15 17:10:44,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:44,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:44,083 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:44,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-15 17:10:44,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:44,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:44,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:44,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:44,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:44,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:44,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:44,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:44,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-12-15 17:10:44,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:44,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:44,141 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:44,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:44,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-15 17:10:44,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:44,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:44,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:44,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:44,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:44,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:44,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:44,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-12-15 17:10:44,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:44,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:44,176 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:44,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-15 17:10:44,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:44,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:44,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:44,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:44,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:44,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:44,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:44,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:44,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:44,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-12-15 17:10:44,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:44,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:44,203 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:44,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-15 17:10:44,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:44,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:44,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:44,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:44,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:44,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:44,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:44,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:44,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-12-15 17:10:44,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:44,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:44,232 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-15 17:10:44,232 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-15 17:10:44,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:44,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:44,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:44,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:44,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:44,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:44,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:44,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:44,258 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-15 17:10:44,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:44,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:44,263 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:44,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-15 17:10:44,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:44,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:44,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:44,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:44,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:44,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:44,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:44,282 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:10:44,299 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2021-12-15 17:10:44,300 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2021-12-15 17:10:44,300 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:44,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:44,301 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:44,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-15 17:10:44,302 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:10:44,308 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:10:44,309 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:10:44,309 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_B~0#1.base)_3, ULTIMATE.start_main_~nc_B~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0#1.base)_3 - 1*ULTIMATE.start_main_~nc_B~0#1 Supporting invariants [] [2021-12-15 17:10:44,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:44,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:44,542 INFO L297 tatePredicateManager]: 86 out of 89 supporting invariants were superfluous and have been removed [2021-12-15 17:10:44,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:44,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 17:10:44,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:44,945 WARN L261 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 17:10:44,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:10:44,972 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2021-12-15 17:10:44,972 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 42 transitions. cyclomatic complexity: 7 Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 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-15 17:10:45,122 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 42 transitions. cyclomatic complexity: 7. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 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) Result 41 states and 46 transitions. Complement of second has 11 states. [2021-12-15 17:10:45,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 7 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-15 17:10:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 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-15 17:10:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2021-12-15 17:10:45,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 31 letters. Loop has 2 letters. [2021-12-15 17:10:45,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:45,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 33 letters. Loop has 2 letters. [2021-12-15 17:10:45,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:45,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 31 letters. Loop has 4 letters. [2021-12-15 17:10:45,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:45,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 46 transitions. [2021-12-15 17:10:45,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:10:45,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 45 transitions. [2021-12-15 17:10:45,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-12-15 17:10:45,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-12-15 17:10:45,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 45 transitions. [2021-12-15 17:10:45,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:10:45,127 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-15 17:10:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 45 transitions. [2021-12-15 17:10:45,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-12-15 17:10:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2021-12-15 17:10:45,128 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-15 17:10:45,128 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-15 17:10:45,129 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:10:45,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2021-12-15 17:10:45,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:10:45,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:45,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:45,130 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:10:45,130 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:10:45,130 INFO L791 eck$LassoCheckResult]: Stem: 1723#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(11, 2); 1724#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 1734#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1742#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1735#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1736#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1758#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1757#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1756#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1755#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1754#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1753#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1752#L35-3 assume !(main_~i~0#1 < 5); 1731#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 1732#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 1719#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1720#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1738#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1751#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1750#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1749#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1748#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1747#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1746#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1745#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1744#L39-3 assume !(main_~i~0#1 < 5); 1743#L39-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 1737#L41 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 1725#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 1727#L44-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 1729#L44-4 main_~nc_B~0#1 := 0; 1730#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 1739#L48-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 1721#L48-4 assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1; 1722#L57-2 [2021-12-15 17:10:45,131 INFO L793 eck$LassoCheckResult]: Loop: 1722#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 1733#L57 assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1722#L57-2 [2021-12-15 17:10:45,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:45,131 INFO L85 PathProgramCache]: Analyzing trace with hash 959422888, now seen corresponding path program 1 times [2021-12-15 17:10:45,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:45,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144266885] [2021-12-15 17:10:45,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:45,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:45,146 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:45,159 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:45,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:45,160 INFO L85 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 1 times [2021-12-15 17:10:45,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:45,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284332780] [2021-12-15 17:10:45,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:45,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:45,163 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:45,166 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:45,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1412570677, now seen corresponding path program 1 times [2021-12-15 17:10:45,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:45,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924860017] [2021-12-15 17:10:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:45,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-15 17:10:45,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:10:45,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924860017] [2021-12-15 17:10:45,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924860017] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:10:45,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:10:45,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:10:45,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537227352] [2021-12-15 17:10:45,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:10:45,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:10:45,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:10:45,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:10:45,298 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:10:45,309 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2021-12-15 17:10:45,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:10:45,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 55 transitions. [2021-12-15 17:10:45,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:10:45,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 45 transitions. [2021-12-15 17:10:45,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-12-15 17:10:45,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-12-15 17:10:45,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 45 transitions. [2021-12-15 17:10:45,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:10:45,314 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2021-12-15 17:10:45,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 45 transitions. [2021-12-15 17:10:45,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2021-12-15 17:10:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.1) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-12-15 17:10:45,326 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-12-15 17:10:45,326 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-12-15 17:10:45,326 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:10:45,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2021-12-15 17:10:45,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:10:45,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:45,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:45,328 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:10:45,328 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:10:45,329 INFO L791 eck$LassoCheckResult]: Stem: 1821#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(11, 2); 1822#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 1832#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1833#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1840#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1856#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1855#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1854#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1853#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1852#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1851#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 1850#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1849#L35-3 assume !(main_~i~0#1 < 5); 1829#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 1830#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 1817#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1818#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1835#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1848#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1847#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1846#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1845#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1844#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1843#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1842#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1841#L39-3 assume !(main_~i~0#1 < 5); 1839#L39-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 1834#L41 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 1823#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 1824#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1825#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 1826#L44-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 1827#L44-4 main_~nc_B~0#1 := 0; 1828#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 1836#L48-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 1819#L48-4 assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1; 1820#L57-2 [2021-12-15 17:10:45,329 INFO L793 eck$LassoCheckResult]: Loop: 1820#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 1831#L57 assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1820#L57-2 [2021-12-15 17:10:45,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:45,330 INFO L85 PathProgramCache]: Analyzing trace with hash 94364173, now seen corresponding path program 1 times [2021-12-15 17:10:45,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:45,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707399957] [2021-12-15 17:10:45,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:45,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-15 17:10:45,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:10:45,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707399957] [2021-12-15 17:10:45,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707399957] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:10:45,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072303896] [2021-12-15 17:10:45,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:45,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:10:45,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:45,373 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:10:45,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2021-12-15 17:10:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:45,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:10:45,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-15 17:10:45,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 17:10:45,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072303896] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:10:45,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 17:10:45,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-15 17:10:45,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288365570] [2021-12-15 17:10:45,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:10:45,517 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:10:45,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 2 times [2021-12-15 17:10:45,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:45,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688564757] [2021-12-15 17:10:45,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:45,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:45,522 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:45,527 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:45,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:10:45,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:10:45,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-15 17:10:45,584 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:45,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:10:45,602 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2021-12-15 17:10:45,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:10:45,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 47 transitions. [2021-12-15 17:10:45,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:10:45,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 45 transitions. [2021-12-15 17:10:45,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-12-15 17:10:45,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-12-15 17:10:45,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 45 transitions. [2021-12-15 17:10:45,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:10:45,606 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 45 transitions. [2021-12-15 17:10:45,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 45 transitions. [2021-12-15 17:10:45,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2021-12-15 17:10:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2021-12-15 17:10:45,612 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2021-12-15 17:10:45,612 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2021-12-15 17:10:45,612 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 17:10:45,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 43 transitions. [2021-12-15 17:10:45,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:10:45,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:45,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:45,614 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:10:45,614 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:10:45,616 INFO L791 eck$LassoCheckResult]: Stem: 2020#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(11, 2); 2021#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 2031#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2032#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2039#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2055#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2054#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2053#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2052#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2051#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2050#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2049#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2048#L35-3 assume !(main_~i~0#1 < 5); 2028#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 2029#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 2016#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2017#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2034#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2047#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2046#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2045#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2044#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2043#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2042#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2041#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2040#L39-3 assume !(main_~i~0#1 < 5); 2038#L39-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 2033#L41 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 2022#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 2023#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2024#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 2025#L44-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 2026#L44-4 main_~nc_B~0#1 := 0; 2027#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 2036#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2037#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 2035#L48-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 2018#L48-4 assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1; 2019#L57-2 [2021-12-15 17:10:45,616 INFO L793 eck$LassoCheckResult]: Loop: 2019#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 2030#L57 assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2019#L57-2 [2021-12-15 17:10:45,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:45,617 INFO L85 PathProgramCache]: Analyzing trace with hash 489706120, now seen corresponding path program 1 times [2021-12-15 17:10:45,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:45,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108129001] [2021-12-15 17:10:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:45,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:45,646 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:45,676 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:45,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:45,683 INFO L85 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 3 times [2021-12-15 17:10:45,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:45,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643305210] [2021-12-15 17:10:45,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:45,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:45,688 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:45,691 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:45,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1838818645, now seen corresponding path program 1 times [2021-12-15 17:10:45,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:45,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709678780] [2021-12-15 17:10:45,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:45,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:45,720 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:45,752 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:50,931 WARN L227 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 280 DAG size of output: 211 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-15 17:10:52,069 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:10:52,069 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:10:52,070 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:10:52,070 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:10:52,070 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:10:52,070 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:52,070 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:10:52,070 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:10:52,070 INFO L133 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration10_Lasso [2021-12-15 17:10:52,070 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:10:52,070 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:10:52,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:52,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:52,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:52,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:52,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:52,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:52,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:52,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:52,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:53,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:53,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:53,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:53,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:53,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:53,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:53,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:53,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:53,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:53,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:10:53,733 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:10:53,733 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:10:53,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:53,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:53,735 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:53,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-15 17:10:53,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:53,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:53,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:53,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:53,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:53,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:53,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:53,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:53,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:53,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:53,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:53,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:53,766 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:53,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-15 17:10:53,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:53,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:53,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:53,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:53,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:53,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:53,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:53,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:53,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:53,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-12-15 17:10:53,791 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:53,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:53,791 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:53,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-15 17:10:53,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:53,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:53,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:53,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:53,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:53,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:53,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:53,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:53,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:53,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2021-12-15 17:10:53,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:53,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:53,817 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:53,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-15 17:10:53,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:53,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:53,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:53,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:53,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:53,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:53,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:53,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:53,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:53,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-12-15 17:10:53,841 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:53,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:53,842 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:53,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-12-15 17:10:53,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-15 17:10:53,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:53,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:53,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:53,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:53,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:53,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:53,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:53,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:53,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2021-12-15 17:10:53,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:53,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:53,866 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:53,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-12-15 17:10:53,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:53,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:53,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:53,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:53,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:53,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:53,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:53,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:53,892 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-15 17:10:53,892 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:53,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:53,893 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:53,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-12-15 17:10:53,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:53,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:53,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:53,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:53,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:53,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:53,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:53,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:53,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:53,917 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-15 17:10:53,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:53,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:53,918 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-15 17:10:53,918 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-15 17:10:53,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:53,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:53,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:53,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:53,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:53,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:53,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:53,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:53,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:53,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:53,943 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:53,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:53,944 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:53,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-12-15 17:10:53,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:53,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:53,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:53,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:53,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:53,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:53,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:53,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:53,971 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-15 17:10:53,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:53,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:53,972 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:53,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-12-15 17:10:53,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-15 17:10:53,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:53,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:53,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:53,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:53,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:53,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:53,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:53,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:53,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2021-12-15 17:10:53,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:53,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:53,996 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:53,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-12-15 17:10:53,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:54,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:54,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:54,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:54,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:54,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:54,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:54,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:54,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:54,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:54,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:54,021 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:54,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-12-15 17:10:54,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:54,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:54,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:54,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:54,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:54,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:54,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:54,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:54,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-12-15 17:10:54,046 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:54,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:54,047 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:54,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-12-15 17:10:54,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:10:54,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:54,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:54,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:54,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:54,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:54,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:54,071 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:10:54,104 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2021-12-15 17:10:54,104 INFO L444 ModelExtractionUtils]: 3 out of 28 variables were initially zero. Simplification set additionally 22 variables to zero. [2021-12-15 17:10:54,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:54,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:54,105 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:10:54,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-12-15 17:10:54,107 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:10:54,112 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:10:54,112 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:10:54,112 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~nc_B~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~nc_B~0#1 Supporting invariants [] [2021-12-15 17:10:54,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-12-15 17:10:54,221 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2021-12-15 17:10:54,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:54,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:10:54,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:54,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:10:54,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:10:54,353 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:10:54,353 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 43 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:54,363 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 43 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 49 transitions. Complement of second has 5 states. [2021-12-15 17:10:54,366 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-15 17:10:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2021-12-15 17:10:54,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 2 letters. [2021-12-15 17:10:54,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:54,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 40 letters. Loop has 2 letters. [2021-12-15 17:10:54,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:54,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 4 letters. [2021-12-15 17:10:54,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:54,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2021-12-15 17:10:54,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:10:54,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 49 transitions. [2021-12-15 17:10:54,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-12-15 17:10:54,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-12-15 17:10:54,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 49 transitions. [2021-12-15 17:10:54,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:10:54,370 INFO L681 BuchiCegarLoop]: Abstraction has 44 states and 49 transitions. [2021-12-15 17:10:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 49 transitions. [2021-12-15 17:10:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-12-15 17:10:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2021-12-15 17:10:54,372 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 49 transitions. [2021-12-15 17:10:54,372 INFO L587 BuchiCegarLoop]: Abstraction has 44 states and 49 transitions. [2021-12-15 17:10:54,372 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-15 17:10:54,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 49 transitions. [2021-12-15 17:10:54,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:10:54,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:54,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:54,373 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:10:54,373 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:10:54,373 INFO L791 eck$LassoCheckResult]: Stem: 2393#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); 2394#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 2408#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2416#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2409#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2410#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2432#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2431#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2430#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2429#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2428#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2427#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2426#L35-3 assume !(main_~i~0#1 < 5); 2401#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 2402#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 2391#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2392#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2412#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2425#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2424#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2423#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2422#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2421#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2420#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2419#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2418#L39-3 assume !(main_~i~0#1 < 5); 2417#L39-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 2411#L41 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 2395#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 2396#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2397#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 2398#L44-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 2399#L44-4 main_~nc_B~0#1 := 0; 2400#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 2414#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2415#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 2413#L48-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 2389#L48-4 assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1; 2390#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 2407#L57 assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0; 2403#L57-2 [2021-12-15 17:10:54,374 INFO L793 eck$LassoCheckResult]: Loop: 2403#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 2404#L57 assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2403#L57-2 [2021-12-15 17:10:54,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:54,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1838818643, now seen corresponding path program 1 times [2021-12-15 17:10:54,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:54,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312168579] [2021-12-15 17:10:54,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:54,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:54,394 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:54,412 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:54,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 4 times [2021-12-15 17:10:54,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:54,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243826546] [2021-12-15 17:10:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:54,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:54,416 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:54,435 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1873154672, now seen corresponding path program 1 times [2021-12-15 17:10:54,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:54,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535071094] [2021-12-15 17:10:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:54,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:54,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-15 17:10:54,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:10:54,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535071094] [2021-12-15 17:10:54,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535071094] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:10:54,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663223853] [2021-12-15 17:10:54,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:54,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:10:54,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:54,524 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:10:54,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2021-12-15 17:10:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:54,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 17:10:54,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-15 17:10:54,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:10:54,769 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-15 17:10:54,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663223853] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:10:54,769 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:10:54,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2021-12-15 17:10:54,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635220087] [2021-12-15 17:10:54,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:10:54,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:10:54,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 17:10:54,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-12-15 17:10:54,832 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:10:54,973 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2021-12-15 17:10:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 17:10:54,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 75 transitions. [2021-12-15 17:10:54,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:10:54,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 47 states and 52 transitions. [2021-12-15 17:10:54,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-12-15 17:10:54,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-12-15 17:10:54,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 52 transitions. [2021-12-15 17:10:54,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:10:54,975 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2021-12-15 17:10:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 52 transitions. [2021-12-15 17:10:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-12-15 17:10:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.108695652173913) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2021-12-15 17:10:54,976 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2021-12-15 17:10:54,976 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2021-12-15 17:10:54,976 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-15 17:10:54,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 51 transitions. [2021-12-15 17:10:54,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:10:54,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:54,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:54,978 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:10:54,978 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:10:54,978 INFO L791 eck$LassoCheckResult]: Stem: 2780#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(11, 2); 2781#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 2795#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2798#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2804#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2821#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2820#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2819#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2818#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2817#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2816#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 2815#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2814#L35-3 assume !(main_~i~0#1 < 5); 2788#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 2789#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 2778#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2779#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2800#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2813#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2812#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2811#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2810#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2809#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2808#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 2807#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2806#L39-3 assume !(main_~i~0#1 < 5); 2805#L39-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 2799#L41 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 2782#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 2783#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2784#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 2785#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2797#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 2796#L44-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 2786#L44-4 main_~nc_B~0#1 := 0; 2787#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 2802#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2803#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 2801#L48-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 2776#L48-4 assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1; 2777#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 2794#L57 assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0; 2790#L57-2 [2021-12-15 17:10:54,978 INFO L793 eck$LassoCheckResult]: Loop: 2790#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 2791#L57 assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2790#L57-2 [2021-12-15 17:10:54,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1199867054, now seen corresponding path program 2 times [2021-12-15 17:10:54,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:54,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838324699] [2021-12-15 17:10:54,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:54,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-15 17:10:55,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:10:55,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838324699] [2021-12-15 17:10:55,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838324699] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:10:55,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503892055] [2021-12-15 17:10:55,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:10:55,045 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:10:55,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:55,048 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:10:55,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2021-12-15 17:10:55,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:10:55,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:10:55,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 17:10:55,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-15 17:10:55,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:10:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-15 17:10:55,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503892055] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:10:55,325 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:10:55,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 17:10:55,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420872606] [2021-12-15 17:10:55,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:10:55,326 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:10:55,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 5 times [2021-12-15 17:10:55,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:55,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793273291] [2021-12-15 17:10:55,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:55,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:55,331 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:55,333 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:55,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:10:55,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 17:10:55,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-12-15 17:10:55,405 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. cyclomatic complexity: 9 Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:10:55,436 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2021-12-15 17:10:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 17:10:55,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 57 transitions. [2021-12-15 17:10:55,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:10:55,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 50 states and 55 transitions. [2021-12-15 17:10:55,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-12-15 17:10:55,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-12-15 17:10:55,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 55 transitions. [2021-12-15 17:10:55,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:10:55,438 INFO L681 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2021-12-15 17:10:55,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 55 transitions. [2021-12-15 17:10:55,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2021-12-15 17:10:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2021-12-15 17:10:55,439 INFO L704 BuchiCegarLoop]: Abstraction has 48 states and 53 transitions. [2021-12-15 17:10:55,439 INFO L587 BuchiCegarLoop]: Abstraction has 48 states and 53 transitions. [2021-12-15 17:10:55,439 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-15 17:10:55,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 53 transitions. [2021-12-15 17:10:55,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:10:55,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:55,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:55,440 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:10:55,440 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:10:55,440 INFO L791 eck$LassoCheckResult]: Stem: 3138#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(11, 2); 3139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 3153#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 3155#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 3162#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 3181#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 3180#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 3179#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 3178#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 3177#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 3176#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 3175#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 3174#L35-3 assume !(main_~i~0#1 < 5); 3146#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 3147#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 3134#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 3135#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3157#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 3173#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3172#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 3171#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3170#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 3169#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3167#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 3166#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3164#L39-3 assume !(main_~i~0#1 < 5); 3163#L39-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 3156#L41 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 3140#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 3141#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 3142#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 3143#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 3168#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 3154#L44-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 3144#L44-4 main_~nc_B~0#1 := 0; 3145#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 3159#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3160#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 3161#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3165#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 3158#L48-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 3136#L48-4 assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1; 3137#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 3152#L57 assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0; 3148#L57-2 [2021-12-15 17:10:55,440 INFO L793 eck$LassoCheckResult]: Loop: 3148#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 3149#L57 assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3148#L57-2 [2021-12-15 17:10:55,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:55,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1976327923, now seen corresponding path program 3 times [2021-12-15 17:10:55,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:55,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306657355] [2021-12-15 17:10:55,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:55,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:55,461 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:55,493 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:55,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:55,494 INFO L85 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 6 times [2021-12-15 17:10:55,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:55,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144895046] [2021-12-15 17:10:55,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:55,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:55,497 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:55,503 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:55,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:55,503 INFO L85 PathProgramCache]: Analyzing trace with hash -875586576, now seen corresponding path program 2 times [2021-12-15 17:10:55,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:55,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83547135] [2021-12-15 17:10:55,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:55,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:55,526 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:55,544 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:00,424 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:11:00,424 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:11:00,424 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:11:00,424 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:11:00,424 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:11:00,425 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:00,425 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:11:00,425 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:11:00,425 INFO L133 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration13_Lasso [2021-12-15 17:11:00,425 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:11:00,425 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:11:00,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:00,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:00,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:00,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:00,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:01,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:01,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:01,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:01,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:01,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:01,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:01,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:01,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:01,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:01,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:01,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:01,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:01,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:01,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:04,452 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:11:04,452 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:11:04,452 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,456 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-12-15 17:11:04,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:11:04,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:11:04,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:11:04,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-12-15 17:11:04,480 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,481 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-12-15 17:11:04,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-15 17:11:04,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:11:04,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:11:04,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:11:04,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-12-15 17:11:04,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,506 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-12-15 17:11:04,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:04,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:04,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:04,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,538 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-12-15 17:11:04,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:11:04,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:11:04,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:11:04,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2021-12-15 17:11:04,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,565 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-12-15 17:11:04,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:04,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:04,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2021-12-15 17:11:04,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,593 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-12-15 17:11:04,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:04,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:04,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,621 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-15 17:11:04,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,622 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-12-15 17:11:04,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:04,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:04,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2021-12-15 17:11:04,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,651 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-12-15 17:11:04,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:04,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:04,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2021-12-15 17:11:04,678 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,679 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-12-15 17:11:04,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:04,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:04,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:04,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,706 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-12-15 17:11:04,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:04,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:04,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2021-12-15 17:11:04,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,734 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-12-15 17:11:04,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:04,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:04,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2021-12-15 17:11:04,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,762 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-12-15 17:11:04,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:04,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:04,774 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:04,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,790 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-12-15 17:11:04,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:04,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:04,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2021-12-15 17:11:04,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,819 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2021-12-15 17:11:04,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:04,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:04,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2021-12-15 17:11:04,898 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,899 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2021-12-15 17:11:04,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:04,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:04,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:04,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2021-12-15 17:11:04,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,926 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2021-12-15 17:11:04,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:04,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:04,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:04,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:04,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:04,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:04,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:04,952 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:11:04,966 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-12-15 17:11:04,966 INFO L444 ModelExtractionUtils]: 14 out of 28 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-12-15 17:11:04,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:04,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:04,967 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:04,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2021-12-15 17:11:04,969 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:11:04,975 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:11:04,976 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:11:04,976 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 1 Supporting invariants [] [2021-12-15 17:11:04,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2021-12-15 17:11:05,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:05,169 INFO L297 tatePredicateManager]: 51 out of 57 supporting invariants were superfluous and have been removed [2021-12-15 17:11:05,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:05,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-15 17:11:05,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:11:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:05,684 WARN L261 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-15 17:11:05,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:11:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:11:05,729 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2021-12-15 17:11:05,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 53 transitions. cyclomatic complexity: 9 Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:05,948 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 53 transitions. cyclomatic complexity: 9. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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) Result 88 states and 104 transitions. Complement of second has 18 states. [2021-12-15 17:11:05,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 11 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-15 17:11:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 66 transitions. [2021-12-15 17:11:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 66 transitions. Stem has 44 letters. Loop has 2 letters. [2021-12-15 17:11:05,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:11:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 66 transitions. Stem has 46 letters. Loop has 2 letters. [2021-12-15 17:11:05,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:11:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 66 transitions. Stem has 44 letters. Loop has 4 letters. [2021-12-15 17:11:05,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:11:05,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 104 transitions. [2021-12-15 17:11:05,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-15 17:11:05,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 88 states and 104 transitions. [2021-12-15 17:11:05,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-12-15 17:11:05,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2021-12-15 17:11:05,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 104 transitions. [2021-12-15 17:11:05,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:11:05,953 INFO L681 BuchiCegarLoop]: Abstraction has 88 states and 104 transitions. [2021-12-15 17:11:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 104 transitions. [2021-12-15 17:11:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2021-12-15 17:11:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.164179104477612) internal successors, (78), 66 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2021-12-15 17:11:05,955 INFO L704 BuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2021-12-15 17:11:05,955 INFO L587 BuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2021-12-15 17:11:05,955 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-15 17:11:05,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 78 transitions. [2021-12-15 17:11:05,956 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-15 17:11:05,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:11:05,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:11:05,957 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:11:05,957 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:11:05,957 INFO L791 eck$LassoCheckResult]: Stem: 3704#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(11, 2); 3705#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 3717#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 3720#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 3730#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 3749#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 3747#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 3745#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 3743#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 3741#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 3739#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 3737#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 3735#L35-3 assume !(main_~i~0#1 < 5); 3712#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 3713#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 3700#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 3701#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3722#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 3748#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3746#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 3744#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3742#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 3740#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3738#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 3736#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3734#L39-3 assume !(main_~i~0#1 < 5); 3731#L39-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 3721#L41 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 3706#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 3707#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 3708#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 3709#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 3750#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 3751#L44-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 3710#L44-4 main_~nc_B~0#1 := 0; 3711#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 3724#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3725#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 3764#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3763#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 3762#L48-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 3761#L48-4 assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1; 3760#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 3759#L57 assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0; 3758#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 3732#L57 [2021-12-15 17:11:05,957 INFO L793 eck$LassoCheckResult]: Loop: 3732#L57 assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0; 3733#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 3732#L57 [2021-12-15 17:11:05,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:05,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1136623388, now seen corresponding path program 4 times [2021-12-15 17:11:05,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:05,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4062737] [2021-12-15 17:11:05,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:05,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:05,974 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:05,991 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:05,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:05,992 INFO L85 PathProgramCache]: Analyzing trace with hash 3708, now seen corresponding path program 1 times [2021-12-15 17:11:05,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:05,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736649795] [2021-12-15 17:11:05,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:05,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:05,996 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:05,998 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1373379937, now seen corresponding path program 5 times [2021-12-15 17:11:05,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:05,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381697489] [2021-12-15 17:11:05,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:06,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-15 17:11:06,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:11:06,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381697489] [2021-12-15 17:11:06,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381697489] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:11:06,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228969689] [2021-12-15 17:11:06,075 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 17:11:06,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:11:06,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:06,080 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:11:06,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2021-12-15 17:11:06,249 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-15 17:11:06,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:11:06,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 17:11:06,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:11:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-15 17:11:06,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:11:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-15 17:11:06,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228969689] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:11:06,559 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:11:06,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 21 [2021-12-15 17:11:06,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689722512] [2021-12-15 17:11:06,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:11:06,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:11:06,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-15 17:11:06,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-12-15 17:11:06,639 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. cyclomatic complexity: 17 Second operand has 22 states, 21 states have (on average 3.380952380952381) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:11:06,792 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2021-12-15 17:11:06,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 17:11:06,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 91 transitions. [2021-12-15 17:11:06,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:11:06,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 51 states and 56 transitions. [2021-12-15 17:11:06,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-12-15 17:11:06,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-12-15 17:11:06,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 56 transitions. [2021-12-15 17:11:06,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:11:06,795 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 56 transitions. [2021-12-15 17:11:06,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 56 transitions. [2021-12-15 17:11:06,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2021-12-15 17:11:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.1) internal successors, (55), 49 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-15 17:11:06,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2021-12-15 17:11:06,797 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2021-12-15 17:11:06,797 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2021-12-15 17:11:06,798 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-15 17:11:06,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 55 transitions. [2021-12-15 17:11:06,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:11:06,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:11:06,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:11:06,799 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:11:06,799 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:11:06,799 INFO L791 eck$LassoCheckResult]: Stem: 4168#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(11, 2); 4169#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 4183#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 4186#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 4194#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 4212#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 4211#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 4210#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 4208#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 4206#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 4202#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 4201#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 4200#L35-3 assume !(main_~i~0#1 < 5); 4176#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 4177#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 4166#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 4167#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4188#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 4209#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4207#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 4205#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4204#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 4203#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4198#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 4197#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4196#L39-3 assume !(main_~i~0#1 < 5); 4193#L39-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 4187#L41 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 4170#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 4171#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4213#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 4185#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4172#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 4173#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4199#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 4184#L44-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 4174#L44-4 main_~nc_B~0#1 := 0; 4175#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 4190#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4191#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 4192#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4195#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 4189#L48-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 4164#L48-4 assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1; 4165#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 4181#L57 assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0; 4178#L57-2 [2021-12-15 17:11:06,799 INFO L793 eck$LassoCheckResult]: Loop: 4178#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 4179#L57 assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4178#L57-2 [2021-12-15 17:11:06,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:06,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1972266802, now seen corresponding path program 6 times [2021-12-15 17:11:06,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:06,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807191409] [2021-12-15 17:11:06,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:06,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-15 17:11:06,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:11:06,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807191409] [2021-12-15 17:11:06,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807191409] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:11:06,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462024367] [2021-12-15 17:11:06,878 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 17:11:06,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:11:06,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:06,879 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:11:06,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2021-12-15 17:11:06,985 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-15 17:11:06,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:11:06,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:11:06,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:11:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-15 17:11:07,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:11:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-15 17:11:07,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462024367] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:11:07,168 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:11:07,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 17:11:07,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939143222] [2021-12-15 17:11:07,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:11:07,169 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:11:07,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:07,170 INFO L85 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 7 times [2021-12-15 17:11:07,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:07,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112045896] [2021-12-15 17:11:07,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:07,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:07,173 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:07,176 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:07,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:11:07,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 17:11:07,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2021-12-15 17:11:07,248 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. cyclomatic complexity: 9 Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:07,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:11:07,286 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2021-12-15 17:11:07,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 17:11:07,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 61 transitions. [2021-12-15 17:11:07,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:11:07,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 54 states and 59 transitions. [2021-12-15 17:11:07,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-12-15 17:11:07,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-12-15 17:11:07,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 59 transitions. [2021-12-15 17:11:07,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:11:07,288 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 59 transitions. [2021-12-15 17:11:07,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 59 transitions. [2021-12-15 17:11:07,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2021-12-15 17:11:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2021-12-15 17:11:07,289 INFO L704 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2021-12-15 17:11:07,289 INFO L587 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2021-12-15 17:11:07,289 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-15 17:11:07,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2021-12-15 17:11:07,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:11:07,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:11:07,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:11:07,291 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:11:07,291 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:11:07,291 INFO L791 eck$LassoCheckResult]: Stem: 4561#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(11, 2); 4562#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 4576#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 4579#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 4586#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 4606#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 4605#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 4604#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 4603#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 4602#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 4601#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 4600#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 4599#L35-3 assume !(main_~i~0#1 < 5); 4569#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 4570#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 4557#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 4558#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4581#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 4598#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4597#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 4596#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4595#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 4594#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4593#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 4591#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4588#L39-3 assume !(main_~i~0#1 < 5); 4587#L39-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 4580#L41 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 4563#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 4564#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4608#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 4578#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4565#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 4566#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4592#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 4577#L44-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 4567#L44-4 main_~nc_B~0#1 := 0; 4568#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 4583#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4584#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 4585#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4607#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 4590#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4589#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 4582#L48-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 4559#L48-4 assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1; 4560#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 4574#L57 assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0; 4571#L57-2 [2021-12-15 17:11:07,291 INFO L793 eck$LassoCheckResult]: Loop: 4571#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 4572#L57 assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4571#L57-2 [2021-12-15 17:11:07,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1312494829, now seen corresponding path program 7 times [2021-12-15 17:11:07,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:07,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507524259] [2021-12-15 17:11:07,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:07,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:07,308 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:07,331 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:07,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 8 times [2021-12-15 17:11:07,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:07,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68233197] [2021-12-15 17:11:07,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:07,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:07,335 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:07,338 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:07,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1412851760, now seen corresponding path program 3 times [2021-12-15 17:11:07,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:07,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025448346] [2021-12-15 17:11:07,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:07,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:07,360 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:07,383 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:13,276 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:11:13,276 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:11:13,276 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:11:13,277 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:11:13,277 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:11:13,277 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:13,277 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:11:13,277 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:11:13,277 INFO L133 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration16_Lasso [2021-12-15 17:11:13,277 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:11:13,277 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:11:13,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:13,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:13,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:13,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:14,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:15,546 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:11:15,546 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:11:15,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:15,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:15,549 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:15,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2021-12-15 17:11:15,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:15,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:15,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:15,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:15,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:15,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:15,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:15,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:15,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2021-12-15 17:11:15,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:15,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:15,575 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:15,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2021-12-15 17:11:15,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:15,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:15,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:11:15,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:15,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:15,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:15,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:11:15,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:11:15,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:15,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2021-12-15 17:11:15,599 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:15,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:15,600 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:15,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2021-12-15 17:11:15,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:15,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:15,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:11:15,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:15,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:15,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:15,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:11:15,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:11:15,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:15,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:15,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:15,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:15,624 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:15,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2021-12-15 17:11:15,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:15,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:15,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:15,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:15,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:15,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:15,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:15,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:15,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2021-12-15 17:11:15,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:15,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:15,653 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:15,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2021-12-15 17:11:15,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:15,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:15,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:15,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:15,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:15,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:15,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:15,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:15,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2021-12-15 17:11:15,678 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:15,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:15,679 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:15,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2021-12-15 17:11:15,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:15,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:15,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:15,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:15,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:15,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:15,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:15,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:11:15,746 INFO L443 ModelExtractionUtils]: Simplification made 30 calls to the SMT solver. [2021-12-15 17:11:15,746 INFO L444 ModelExtractionUtils]: 3 out of 28 variables were initially zero. Simplification set additionally 22 variables to zero. [2021-12-15 17:11:15,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:15,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:15,748 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:15,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2021-12-15 17:11:15,750 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:11:15,756 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:11:15,756 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:11:15,757 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~nc_B~0#1) = -6*ULTIMATE.start_main_~i~0#1 + 5*ULTIMATE.start_main_~nc_B~0#1 Supporting invariants [] [2021-12-15 17:11:15,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:16,041 INFO L297 tatePredicateManager]: 85 out of 88 supporting invariants were superfluous and have been removed [2021-12-15 17:11:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:16,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-15 17:11:16,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:11:16,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:16,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 17:11:16,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:11:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:11:16,598 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2021-12-15 17:11:16,598 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 9 Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:16,722 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 9. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 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 85 states and 100 transitions. Complement of second has 15 states. [2021-12-15 17:11:16,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 1 non-accepting loop states 2 accepting loop states [2021-12-15 17:11:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2021-12-15 17:11:16,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 55 transitions. Stem has 48 letters. Loop has 2 letters. [2021-12-15 17:11:16,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:11:16,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 55 transitions. Stem has 50 letters. Loop has 2 letters. [2021-12-15 17:11:16,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:11:16,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 55 transitions. Stem has 48 letters. Loop has 4 letters. [2021-12-15 17:11:16,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:11:16,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 100 transitions. [2021-12-15 17:11:16,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:11:16,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 100 transitions. [2021-12-15 17:11:16,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2021-12-15 17:11:16,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2021-12-15 17:11:16,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 100 transitions. [2021-12-15 17:11:16,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:11:16,726 INFO L681 BuchiCegarLoop]: Abstraction has 85 states and 100 transitions. [2021-12-15 17:11:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 100 transitions. [2021-12-15 17:11:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2021-12-15 17:11:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2021-12-15 17:11:16,727 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2021-12-15 17:11:16,727 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2021-12-15 17:11:16,727 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-15 17:11:16,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 78 transitions. [2021-12-15 17:11:16,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:11:16,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:11:16,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:11:16,728 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:11:16,728 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:11:16,729 INFO L791 eck$LassoCheckResult]: Stem: 5258#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(11, 2); 5259#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 5273#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 5277#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5287#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 5305#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5303#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 5301#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5299#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 5297#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5295#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 5293#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5291#L35-3 assume !(main_~i~0#1 < 5); 5266#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 5267#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 5254#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 5255#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5279#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 5304#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5302#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 5300#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5298#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 5296#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5294#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 5292#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5290#L39-3 assume !(main_~i~0#1 < 5); 5288#L39-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 5278#L41 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 5260#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 5261#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5276#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 5312#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5262#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 5263#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5306#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 5307#L44-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 5264#L44-4 main_~nc_B~0#1 := 0; 5265#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 5281#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5282#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 5314#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5315#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 5322#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5321#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 5320#L48-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 5319#L48-4 assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1; 5318#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 5289#L57 assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0; 5257#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 5271#L57 assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0; 5268#L57-2 [2021-12-15 17:11:16,729 INFO L793 eck$LassoCheckResult]: Loop: 5268#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 5269#L57 assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 5268#L57-2 [2021-12-15 17:11:16,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:16,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1412851758, now seen corresponding path program 8 times [2021-12-15 17:11:16,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:16,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525521627] [2021-12-15 17:11:16,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:16,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:16,763 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:16,787 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:16,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:16,788 INFO L85 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 9 times [2021-12-15 17:11:16,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:16,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523014041] [2021-12-15 17:11:16,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:16,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:16,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:16,794 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:16,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:16,795 INFO L85 PathProgramCache]: Analyzing trace with hash -540871307, now seen corresponding path program 4 times [2021-12-15 17:11:16,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:16,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381975223] [2021-12-15 17:11:16,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:16,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:16,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:16,869 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:22,552 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:11:22,552 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:11:22,552 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:11:22,552 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:11:22,552 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:11:22,552 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:22,553 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:11:22,553 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:11:22,553 INFO L133 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration17_Lasso [2021-12-15 17:11:22,553 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:11:22,553 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:11:22,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:22,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:22,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:22,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:22,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:22,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:22,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:22,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:22,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:22,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:22,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:24,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:24,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:24,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:24,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:24,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:24,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:24,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:24,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:11:24,483 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-12-15 17:11:28,260 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:11:28,260 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:11:28,260 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,268 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2021-12-15 17:11:28,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:11:28,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:11:28,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:11:28,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:28,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,296 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2021-12-15 17:11:28,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:11:28,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:11:28,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:11:28,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:28,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,321 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2021-12-15 17:11:28,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:11:28,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:11:28,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:11:28,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2021-12-15 17:11:28,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,346 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2021-12-15 17:11:28,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:11:28,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:11:28,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:11:28,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:28,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,371 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2021-12-15 17:11:28,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:28,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:28,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2021-12-15 17:11:28,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,399 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2021-12-15 17:11:28,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:28,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:28,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:28,425 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,426 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2021-12-15 17:11:28,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:11:28,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:11:28,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:11:28,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2021-12-15 17:11:28,450 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,451 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2021-12-15 17:11:28,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-15 17:11:28,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:28,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:28,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2021-12-15 17:11:28,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,478 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2021-12-15 17:11:28,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:11:28,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:11:28,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:11:28,489 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2021-12-15 17:11:28,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,505 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2021-12-15 17:11:28,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-15 17:11:28,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:11:28,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:11:28,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:11:28,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2021-12-15 17:11:28,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,532 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2021-12-15 17:11:28,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:28,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:28,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:28,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,579 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2021-12-15 17:11:28,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:28,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:28,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2021-12-15 17:11:28,608 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,609 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2021-12-15 17:11:28,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:28,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:28,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2021-12-15 17:11:28,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,637 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2021-12-15 17:11:28,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-15 17:11:28,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:28,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:28,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:28,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,666 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2021-12-15 17:11:28,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:28,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:28,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2021-12-15 17:11:28,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,695 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2021-12-15 17:11:28,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,746 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-15 17:11:28,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,748 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-15 17:11:28,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:28,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:28,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,768 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2021-12-15 17:11:28,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:28,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:28,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2021-12-15 17:11:28,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,797 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2021-12-15 17:11:28,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:28,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:28,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:28,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:28,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2021-12-15 17:11:28,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:28,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:28,825 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:28,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2021-12-15 17:11:28,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:28,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:28,840 INFO L203 nArgumentSynthesizer]: 36 stem disjuncts [2021-12-15 17:11:28,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:28,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:28,936 INFO L401 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2021-12-15 17:11:28,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:29,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:29,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:29,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:29,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:29,087 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:29,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-15 17:11:29,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:29,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:29,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:29,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:29,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:29,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:29,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2021-12-15 17:11:29,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:29,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:29,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:29,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:29,145 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:29,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:29,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:29,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:29,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:29,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:29,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:29,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:29,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2021-12-15 17:11:29,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:29,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:29,195 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:29,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:29,196 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:29,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2021-12-15 17:11:29,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:29,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:29,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:29,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:29,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:29,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:29,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:29,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:29,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:29,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:29,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:29,260 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:29,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:29,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:29,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:29,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:29,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:29,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:29,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:29,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2021-12-15 17:11:29,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:11:29,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2021-12-15 17:11:29,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:29,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:29,310 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:29,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2021-12-15 17:11:29,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:11:29,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:11:29,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:11:29,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:11:29,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:11:29,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:11:29,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:11:29,336 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:11:29,355 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2021-12-15 17:11:29,355 INFO L444 ModelExtractionUtils]: 3 out of 28 variables were initially zero. Simplification set additionally 22 variables to zero. [2021-12-15 17:11:29,355 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:29,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:29,356 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:29,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2021-12-15 17:11:29,358 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:11:29,364 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:11:29,365 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:11:29,365 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2021-12-15 17:11:29,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:29,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2021-12-15 17:11:29,763 INFO L297 tatePredicateManager]: 119 out of 121 supporting invariants were superfluous and have been removed [2021-12-15 17:11:29,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:29,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-15 17:11:29,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:11:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:30,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:11:30,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:11:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:11:30,231 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2021-12-15 17:11:30,231 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 78 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:30,310 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 78 transitions. cyclomatic complexity: 14. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 90 states and 109 transitions. Complement of second has 11 states. [2021-12-15 17:11:30,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2021-12-15 17:11:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2021-12-15 17:11:30,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 50 letters. Loop has 2 letters. [2021-12-15 17:11:30,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:11:30,311 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:11:30,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:30,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-15 17:11:30,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:11:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:30,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:11:30,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:11:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:11:30,742 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2021-12-15 17:11:30,742 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 78 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:30,831 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 78 transitions. cyclomatic complexity: 14. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 90 states and 109 transitions. Complement of second has 11 states. [2021-12-15 17:11:30,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2021-12-15 17:11:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2021-12-15 17:11:30,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 50 letters. Loop has 2 letters. [2021-12-15 17:11:30,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:11:30,835 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:11:30,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:30,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-15 17:11:30,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:11:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:31,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:11:31,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:11:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:11:31,308 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2021-12-15 17:11:31,308 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 78 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:31,381 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 78 transitions. cyclomatic complexity: 14. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 90 states and 109 transitions. Complement of second has 10 states. [2021-12-15 17:11:31,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2021-12-15 17:11:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2021-12-15 17:11:31,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 50 letters. Loop has 2 letters. [2021-12-15 17:11:31,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:11:31,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 52 letters. Loop has 2 letters. [2021-12-15 17:11:31,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:11:31,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 50 letters. Loop has 4 letters. [2021-12-15 17:11:31,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:11:31,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 109 transitions. [2021-12-15 17:11:31,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-15 17:11:31,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 88 states and 105 transitions. [2021-12-15 17:11:31,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2021-12-15 17:11:31,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2021-12-15 17:11:31,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 105 transitions. [2021-12-15 17:11:31,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:11:31,386 INFO L681 BuchiCegarLoop]: Abstraction has 88 states and 105 transitions. [2021-12-15 17:11:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 105 transitions. [2021-12-15 17:11:31,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2021-12-15 17:11:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:11:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2021-12-15 17:11:31,387 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2021-12-15 17:11:31,388 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2021-12-15 17:11:31,388 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-15 17:11:31,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 78 transitions. [2021-12-15 17:11:31,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:11:31,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:11:31,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:11:31,389 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:11:31,389 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:11:31,389 INFO L791 eck$LassoCheckResult]: Stem: 6650#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(11, 2); 6651#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post8#1, main_#t~mem7#1, main_#t~post10#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0; 6665#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 6668#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 6678#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 6695#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 6693#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 6691#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 6689#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 6687#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 6685#L35-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet2#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet2#1; 6683#L35-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 6681#L35-3 assume !(main_~i~0#1 < 5); 6658#L35-4 call main_#t~mem3#1 := read~int(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 6659#L37 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 6646#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 6647#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6670#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 6694#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6692#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 6690#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6688#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 6686#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6684#L39-3 assume !!(main_~i~0#1 < 5);call write~int(main_#t~nondet5#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 6682#L39-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6680#L39-3 assume !(main_~i~0#1 < 5); 6679#L39-4 call main_#t~mem6#1 := read~int(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 6669#L41 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 6652#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 6653#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 6654#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 6655#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 6701#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 6699#L44-1 assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 6700#L44-3 call main_#t~mem7#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1); 6666#L44-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 6667#L44-4 main_~nc_B~0#1 := 0; 6674#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 6675#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6676#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 6677#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6704#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 6703#L48-1 assume !!(0 != main_#t~mem9#1);havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6702#L48-3 call main_#t~mem9#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1); 6671#L48-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 6648#L48-4 assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1; 6649#L57-2 [2021-12-15 17:11:31,389 INFO L793 eck$LassoCheckResult]: Loop: 6649#L57-2 assume !!(main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1);call main_#t~mem11#1 := read~int(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1); 6664#L57 assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0; 6649#L57-2 [2021-12-15 17:11:31,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1972313288, now seen corresponding path program 2 times [2021-12-15 17:11:31,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:31,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934449432] [2021-12-15 17:11:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:31,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:31,411 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:31,431 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:31,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:31,431 INFO L85 PathProgramCache]: Analyzing trace with hash 3558, now seen corresponding path program 2 times [2021-12-15 17:11:31,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:31,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432795425] [2021-12-15 17:11:31,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:31,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:31,435 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:31,437 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:31,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:31,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1312494829, now seen corresponding path program 9 times [2021-12-15 17:11:31,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:31,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083423599] [2021-12-15 17:11:31,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:31,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:31,454 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:31,470 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace