./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 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/array-memsafety/cstrcspn-alloca-1.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 15fe42cb945ebd9019cc38134c29264613097f232589ff55d01d33d66b19d85f --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 03:13:00,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 03:13:00,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 03:13:00,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 03:13:00,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 03:13:00,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 03:13:00,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 03:13:00,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 03:13:00,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 03:13:00,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 03:13:00,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 03:13:00,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 03:13:00,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 03:13:00,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 03:13:00,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 03:13:00,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 03:13:00,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 03:13:00,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 03:13:00,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 03:13:00,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 03:13:00,227 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 03:13:00,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 03:13:00,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 03:13:00,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 03:13:00,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 03:13:00,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 03:13:00,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 03:13:00,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 03:13:00,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 03:13:00,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 03:13:00,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 03:13:00,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 03:13:00,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 03:13:00,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 03:13:00,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 03:13:00,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 03:13:00,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 03:13:00,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 03:13:00,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 03:13:00,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 03:13:00,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 03:13:00,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 03:13:00,257 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 03:13:00,282 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 03:13:00,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 03:13:00,283 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 03:13:00,283 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 03:13:00,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 03:13:00,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 03:13:00,285 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 03:13:00,285 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 03:13:00,285 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 03:13:00,286 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 03:13:00,286 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 03:13:00,286 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 03:13:00,286 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 03:13:00,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 03:13:00,286 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 03:13:00,287 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 03:13:00,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 03:13:00,287 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 03:13:00,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 03:13:00,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 03:13:00,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 03:13:00,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 03:13:00,288 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 03:13:00,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 03:13:00,288 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 03:13:00,288 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 03:13:00,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 03:13:00,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 03:13:00,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 03:13:00,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 03:13:00,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 03:13:00,291 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 03:13:00,292 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 -> 15fe42cb945ebd9019cc38134c29264613097f232589ff55d01d33d66b19d85f [2022-07-22 03:13:00,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 03:13:00,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 03:13:00,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 03:13:00,586 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 03:13:00,586 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 03:13:00,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2022-07-22 03:13:00,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069c58532/a42c227c98104c2fa70592c77ea8e42f/FLAG4faa40d9c [2022-07-22 03:13:01,021 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 03:13:01,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2022-07-22 03:13:01,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069c58532/a42c227c98104c2fa70592c77ea8e42f/FLAG4faa40d9c [2022-07-22 03:13:01,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069c58532/a42c227c98104c2fa70592c77ea8e42f [2022-07-22 03:13:01,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 03:13:01,053 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 03:13:01,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 03:13:01,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 03:13:01,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 03:13:01,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:13:01" (1/1) ... [2022-07-22 03:13:01,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6e282c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:13:01, skipping insertion in model container [2022-07-22 03:13:01,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:13:01" (1/1) ... [2022-07-22 03:13:01,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 03:13:01,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 03:13:01,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 03:13:01,364 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 03:13:01,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 03:13:01,418 INFO L208 MainTranslator]: Completed translation [2022-07-22 03:13:01,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:13:01 WrapperNode [2022-07-22 03:13:01,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 03:13:01,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 03:13:01,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 03:13:01,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 03:13:01,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:13:01" (1/1) ... [2022-07-22 03:13:01,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:13:01" (1/1) ... [2022-07-22 03:13:01,472 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2022-07-22 03:13:01,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 03:13:01,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 03:13:01,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 03:13:01,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 03:13:01,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:13:01" (1/1) ... [2022-07-22 03:13:01,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:13:01" (1/1) ... [2022-07-22 03:13:01,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:13:01" (1/1) ... [2022-07-22 03:13:01,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:13:01" (1/1) ... [2022-07-22 03:13:01,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:13:01" (1/1) ... [2022-07-22 03:13:01,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:13:01" (1/1) ... [2022-07-22 03:13:01,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:13:01" (1/1) ... [2022-07-22 03:13:01,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 03:13:01,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 03:13:01,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 03:13:01,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 03:13:01,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:13:01" (1/1) ... [2022-07-22 03:13:01,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:01,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:01,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:01,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 03:13:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 03:13:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 03:13:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 03:13:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 03:13:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 03:13:01,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 03:13:01,631 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 03:13:01,632 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 03:13:01,824 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 03:13:01,828 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 03:13:01,828 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 03:13:01,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:13:01 BoogieIcfgContainer [2022-07-22 03:13:01,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 03:13:01,831 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 03:13:01,832 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 03:13:01,834 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 03:13:01,834 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:13:01,835 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 03:13:01" (1/3) ... [2022-07-22 03:13:01,835 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54c2d49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 03:13:01, skipping insertion in model container [2022-07-22 03:13:01,836 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:13:01,836 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:13:01" (2/3) ... [2022-07-22 03:13:01,836 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54c2d49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 03:13:01, skipping insertion in model container [2022-07-22 03:13:01,836 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:13:01,836 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:13:01" (3/3) ... [2022-07-22 03:13:01,837 INFO L354 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca-1.i [2022-07-22 03:13:01,886 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 03:13:01,886 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 03:13:01,886 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 03:13:01,886 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 03:13:01,886 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 03:13:01,886 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 03:13:01,887 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 03:13:01,887 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 03:13:01,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:01,906 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-07-22 03:13:01,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:13:01,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:13:01,910 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 03:13:01,910 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:13:01,911 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 03:13:01,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:01,914 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-07-22 03:13:01,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:13:01,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:13:01,915 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 03:13:01,915 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:13:01,929 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 10#L532true assume !(main_~length1~0#1 < 1); 6#L532-2true assume !(main_~length2~0#1 < 1); 2#L535-1true call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 17#L541-3true [2022-07-22 03:13:01,930 INFO L754 eck$LassoCheckResult]: Loop: 17#L541-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 23#L541-2true main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 17#L541-3true [2022-07-22 03:13:01,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-07-22 03:13:01,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:01,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640171662] [2022-07-22 03:13:01,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:01,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:02,028 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:02,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:02,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:02,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-07-22 03:13:02,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:02,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127206113] [2022-07-22 03:13:02,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:02,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:02,084 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:02,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:02,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:02,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-07-22 03:13:02,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:02,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839342639] [2022-07-22 03:13:02,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:02,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:02,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:02,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:02,453 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:13:02,453 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:13:02,453 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:13:02,453 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:13:02,454 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:13:02,454 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:02,454 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:13:02,454 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:13:02,454 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration1_Lasso [2022-07-22 03:13:02,454 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:13:02,455 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:13:02,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:02,837 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:13:02,840 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:13:02,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:02,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:02,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:02,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:02,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:02,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:02,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:02,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:02,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 03:13:02,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:02,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:02,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:02,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 03:13:02,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:02,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:02,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:02,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 03:13:02,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:02,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:02,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:02,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:02,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:02,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:02,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:02,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:02,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:02,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:02,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:02,954 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:02,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 03:13:02,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:02,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:02,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:02,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:02,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:02,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:02,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:02,986 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:13:03,003 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-22 03:13:03,004 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 03:13:03,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:03,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:03,006 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:03,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 03:13:03,009 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:13:03,026 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 03:13:03,027 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:13:03,027 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~nondetString1~0#1.offset >= 0] [2022-07-22 03:13:03,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:03,082 INFO L293 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2022-07-22 03:13:03,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:03,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-22 03:13:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:03,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 03:13:03,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:03,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 03:13:03,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:13:03,228 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 03:13:03,229 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:03,302 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 60 states and 87 transitions. Complement of second has 7 states. [2022-07-22 03:13:03,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 03:13:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-07-22 03:13:03,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 03:13:03,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:03,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 03:13:03,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:03,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-22 03:13:03,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:03,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2022-07-22 03:13:03,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-22 03:13:03,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2022-07-22 03:13:03,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-22 03:13:03,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-22 03:13:03,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2022-07-22 03:13:03,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:13:03,320 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-22 03:13:03,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2022-07-22 03:13:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 03:13:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-07-22 03:13:03,338 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-22 03:13:03,338 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-22 03:13:03,338 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 03:13:03,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-07-22 03:13:03,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-22 03:13:03,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:13:03,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:13:03,341 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:13:03,341 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:13:03,341 INFO L752 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 170#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 174#L532 assume !(main_~length1~0#1 < 1); 171#L532-2 assume !(main_~length2~0#1 < 1); 165#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 166#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 175#L541-4 main_~i~1#1 := 0; 168#L547-3 [2022-07-22 03:13:03,341 INFO L754 eck$LassoCheckResult]: Loop: 168#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 167#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 168#L547-3 [2022-07-22 03:13:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:03,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-07-22 03:13:03,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:03,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426938309] [2022-07-22 03:13:03,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:03,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:03,370 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:03,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-07-22 03:13:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:03,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310239337] [2022-07-22 03:13:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:03,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:03,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:03,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:03,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-07-22 03:13:03,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:03,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991818931] [2022-07-22 03:13:03,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:03,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:03,427 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:03,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:03,654 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:13:03,654 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:13:03,654 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:13:03,654 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:13:03,654 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:13:03,654 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:03,654 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:13:03,654 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:13:03,654 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration2_Lasso [2022-07-22 03:13:03,654 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:13:03,654 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:13:03,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:03,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:03,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:03,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:03,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:03,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:03,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:03,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:03,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:03,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:03,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:03,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:03,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:03,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:03,983 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:13:03,983 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:13:03,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:03,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:03,985 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:03,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 03:13:03,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:03,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:03,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:03,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:03,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:03,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:03,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:03,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:04,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:04,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-22 03:13:04,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:04,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:04,025 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:04,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 03:13:04,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:04,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:04,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:04,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:04,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:04,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:04,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:04,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:04,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:04,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:04,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:04,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:04,076 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:04,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 03:13:04,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:04,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:04,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:04,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:04,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:04,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:04,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:04,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:04,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:04,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:04,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:04,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:04,120 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:04,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 03:13:04,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:04,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:04,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:04,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:04,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:04,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:04,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:04,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:04,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:04,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:04,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:04,160 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:04,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 03:13:04,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:04,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:04,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:04,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:04,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:04,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:04,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:04,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:04,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:04,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:04,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:04,214 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:04,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 03:13:04,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:04,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:04,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:04,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:04,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:04,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:04,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:04,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:04,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:04,242 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 [2022-07-22 03:13:04,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:04,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:04,244 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:04,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 03:13:04,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:04,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:04,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:04,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:04,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:04,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:04,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:04,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:04,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:04,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:04,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:04,284 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:04,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 03:13:04,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:04,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:04,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:04,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:04,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:04,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:04,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:04,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:04,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-22 03:13:04,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:04,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:04,321 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:04,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 03:13:04,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 [2022-07-22 03:13:04,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:04,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:04,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:04,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:04,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:04,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:04,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:04,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:04,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:04,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:04,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:04,362 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:04,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 03:13:04,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:04,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:04,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:04,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:04,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:04,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:04,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:04,382 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:13:04,402 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-22 03:13:04,402 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 03:13:04,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:04,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:04,404 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:04,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 03:13:04,405 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:13:04,414 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 03:13:04,414 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:13:04,414 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_2) = -1*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_2 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_2 - 1*ULTIMATE.start_main_~length2~0#1 >= 0] [2022-07-22 03:13:04,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-22 03:13:04,460 INFO L293 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2022-07-22 03:13:04,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:04,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 03:13:04,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:04,556 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 03:13:04,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-22 03:13:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:04,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 03:13:04,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:13:04,598 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 [2022-07-22 03:13:04,598 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:04,631 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 44 transitions. Complement of second has 7 states. [2022-07-22 03:13:04,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 03:13:04,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-07-22 03:13:04,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 03:13:04,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:04,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 03:13:04,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:04,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-22 03:13:04,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:04,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2022-07-22 03:13:04,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-22 03:13:04,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2022-07-22 03:13:04,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-22 03:13:04,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-22 03:13:04,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2022-07-22 03:13:04,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:13:04,634 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-07-22 03:13:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2022-07-22 03:13:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-22 03:13:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:04,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-07-22 03:13:04,636 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-07-22 03:13:04,636 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-07-22 03:13:04,636 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 03:13:04,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2022-07-22 03:13:04,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-22 03:13:04,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:13:04,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:13:04,636 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:13:04,636 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:13:04,637 INFO L752 eck$LassoCheckResult]: Stem: 303#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 304#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 310#L532 assume !(main_~length1~0#1 < 1); 307#L532-2 assume !(main_~length2~0#1 < 1); 301#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 302#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 311#L541-4 main_~i~1#1 := 0; 312#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 317#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 316#L519-4 [2022-07-22 03:13:04,637 INFO L754 eck$LassoCheckResult]: Loop: 316#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 320#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 314#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 321#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 313#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 308#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 309#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 315#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 316#L519-4 [2022-07-22 03:13:04,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2022-07-22 03:13:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:04,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795909922] [2022-07-22 03:13:04,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:04,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:04,664 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:04,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:04,691 INFO L85 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2022-07-22 03:13:04,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:04,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406525653] [2022-07-22 03:13:04,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:04,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:04,699 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:04,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:04,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:04,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2022-07-22 03:13:04,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:04,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828082688] [2022-07-22 03:13:04,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:04,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:13:04,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:13:04,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828082688] [2022-07-22 03:13:04,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828082688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:13:04,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:13:04,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 03:13:04,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039686188] [2022-07-22 03:13:04,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:13:04,900 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 [2022-07-22 03:13:05,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:13:05,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 03:13:05,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-22 03:13:05,049 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:13:05,163 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-07-22 03:13:05,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 03:13:05,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2022-07-22 03:13:05,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-22 03:13:05,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 42 transitions. [2022-07-22 03:13:05,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-22 03:13:05,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-22 03:13:05,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2022-07-22 03:13:05,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:13:05,166 INFO L369 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-22 03:13:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2022-07-22 03:13:05,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-07-22 03:13:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 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) [2022-07-22 03:13:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-22 03:13:05,168 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-22 03:13:05,168 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-22 03:13:05,168 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 03:13:05,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2022-07-22 03:13:05,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-22 03:13:05,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:13:05,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:13:05,170 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:13:05,170 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:13:05,170 INFO L752 eck$LassoCheckResult]: Stem: 382#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 383#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 389#L532 assume !(main_~length1~0#1 < 1); 386#L532-2 assume !(main_~length2~0#1 < 1); 380#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 381#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 390#L541-4 main_~i~1#1 := 0; 391#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 395#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 394#L519-4 [2022-07-22 03:13:05,170 INFO L754 eck$LassoCheckResult]: Loop: 394#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 399#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 401#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 400#L522-1 assume !cstrcspn_#t~short7#1; 392#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 387#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 388#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 393#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 394#L519-4 [2022-07-22 03:13:05,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:05,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 2 times [2022-07-22 03:13:05,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:05,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221986011] [2022-07-22 03:13:05,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:05,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:05,181 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:05,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:05,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:05,190 INFO L85 PathProgramCache]: Analyzing trace with hash -903038413, now seen corresponding path program 1 times [2022-07-22 03:13:05,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:05,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524786365] [2022-07-22 03:13:05,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:05,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:05,195 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:05,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:05,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:05,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1905417352, now seen corresponding path program 1 times [2022-07-22 03:13:05,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:05,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165053163] [2022-07-22 03:13:05,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:05,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:13:05,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:13:05,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165053163] [2022-07-22 03:13:05,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165053163] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:13:05,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:13:05,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 03:13:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567530063] [2022-07-22 03:13:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:13:05,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:13:05,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 03:13:05,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-22 03:13:05,441 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:05,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:13:05,666 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-07-22 03:13:05,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 03:13:05,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 80 transitions. [2022-07-22 03:13:05,668 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2022-07-22 03:13:05,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 61 states and 75 transitions. [2022-07-22 03:13:05,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-22 03:13:05,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-22 03:13:05,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 75 transitions. [2022-07-22 03:13:05,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:13:05,669 INFO L369 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2022-07-22 03:13:05,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 75 transitions. [2022-07-22 03:13:05,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2022-07-22 03:13:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 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) [2022-07-22 03:13:05,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-07-22 03:13:05,672 INFO L392 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-07-22 03:13:05,672 INFO L374 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-07-22 03:13:05,672 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 03:13:05,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2022-07-22 03:13:05,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-22 03:13:05,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:13:05,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:13:05,673 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:13:05,674 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:13:05,674 INFO L752 eck$LassoCheckResult]: Stem: 505#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 506#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 512#L532 assume !(main_~length1~0#1 < 1); 509#L532-2 assume !(main_~length2~0#1 < 1); 503#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 504#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 520#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 521#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 513#L541-4 main_~i~1#1 := 0; 514#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 532#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 536#L519-4 [2022-07-22 03:13:05,674 INFO L754 eck$LassoCheckResult]: Loop: 536#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 535#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 534#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 527#L522-1 assume !cstrcspn_#t~short7#1; 528#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 539#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 538#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 537#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 536#L519-4 [2022-07-22 03:13:05,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:05,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2022-07-22 03:13:05,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:05,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889627649] [2022-07-22 03:13:05,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:05,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:05,684 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:05,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:05,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:05,714 INFO L85 PathProgramCache]: Analyzing trace with hash -903038413, now seen corresponding path program 2 times [2022-07-22 03:13:05,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:05,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981145172] [2022-07-22 03:13:05,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:05,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:05,720 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:05,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:05,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:05,724 INFO L85 PathProgramCache]: Analyzing trace with hash -162323734, now seen corresponding path program 1 times [2022-07-22 03:13:05,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:05,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992891915] [2022-07-22 03:13:05,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:05,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:05,735 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:05,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:06,366 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:13:06,367 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:13:06,367 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:13:06,367 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:13:06,367 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:13:06,367 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:06,367 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:13:06,367 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:13:06,367 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration5_Lasso [2022-07-22 03:13:06,368 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:13:06,368 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:13:06,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:06,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:07,264 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:13:07,265 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:13:07,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:07,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:07,266 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:07,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 03:13:07,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:07,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:07,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:07,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:07,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:07,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:07,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:07,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:07,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:07,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:07,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:07,313 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:07,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 03:13:07,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:07,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:07,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:07,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:07,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:07,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:07,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:07,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:07,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:07,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:07,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:07,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:07,339 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:07,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 03:13:07,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:07,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:07,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:07,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:07,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:07,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:07,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:07,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:07,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:07,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-07-22 03:13:07,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:07,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:07,367 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:07,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:07,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 03:13:07,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:07,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:07,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:07,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:07,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:07,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:07,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:07,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:07,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:07,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:07,415 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:07,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 03:13:07,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:07,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:07,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:07,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:07,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:07,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:07,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:07,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:07,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:07,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:07,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:07,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:07,446 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:07,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 03:13:07,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:07,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:07,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:07,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:07,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:07,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:07,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:07,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:07,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:07,480 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 [2022-07-22 03:13:07,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:07,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:07,481 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:07,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 03:13:07,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 [2022-07-22 03:13:07,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:07,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:07,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:07,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:07,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:07,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:07,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:07,530 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 [2022-07-22 03:13:07,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:07,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:07,531 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:07,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 03:13:07,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:07,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:07,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:07,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:07,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:07,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:07,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:07,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:07,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 03:13:07,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:07,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:07,562 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:07,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 03:13:07,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:07,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:07,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:07,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:07,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:07,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:07,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:07,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:07,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-22 03:13:07,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:07,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:07,590 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:07,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 03:13:07,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:07,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:07,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:07,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:07,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:07,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:07,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:07,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:07,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-22 03:13:07,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:07,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:07,641 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:07,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 03:13:07,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:07,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:07,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:07,649 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 03:13:07,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:07,653 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-22 03:13:07,654 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-22 03:13:07,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:07,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-22 03:13:07,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:07,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:07,688 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:07,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 03:13:07,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:07,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:07,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:07,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:07,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:07,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:07,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:07,720 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:13:07,755 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-07-22 03:13:07,756 INFO L444 ModelExtractionUtils]: 45 out of 61 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-07-22 03:13:07,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:07,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:07,757 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:07,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 03:13:07,759 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:13:07,773 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 03:13:07,773 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:13:07,774 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3) = -1*ULTIMATE.start_cstrcspn_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3 Supporting invariants [] [2022-07-22 03:13:07,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 03:13:07,835 INFO L293 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 03:13:07,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:07,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:07,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 03:13:07,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:07,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 03:13:07,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:13:07,965 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 [2022-07-22 03:13:07,965 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:07,997 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 74 transitions. Complement of second has 5 states. [2022-07-22 03:13:07,997 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 [2022-07-22 03:13:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-07-22 03:13:07,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 8 letters. [2022-07-22 03:13:08,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:08,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 19 letters. Loop has 8 letters. [2022-07-22 03:13:08,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:08,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 16 letters. [2022-07-22 03:13:08,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:08,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 74 transitions. [2022-07-22 03:13:08,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 03:13:08,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 39 states and 50 transitions. [2022-07-22 03:13:08,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-22 03:13:08,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-22 03:13:08,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2022-07-22 03:13:08,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:13:08,006 INFO L369 hiAutomatonCegarLoop]: Abstraction has 39 states and 50 transitions. [2022-07-22 03:13:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2022-07-22 03:13:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-07-22 03:13:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-07-22 03:13:08,015 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-07-22 03:13:08,015 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-07-22 03:13:08,015 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 03:13:08,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2022-07-22 03:13:08,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 03:13:08,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:13:08,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:13:08,018 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:13:08,018 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:13:08,018 INFO L752 eck$LassoCheckResult]: Stem: 746#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 747#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 753#L532 assume !(main_~length1~0#1 < 1); 750#L532-2 assume !(main_~length2~0#1 < 1); 744#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 745#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 754#L541-4 main_~i~1#1 := 0; 755#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 748#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 749#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 779#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 778#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 767#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 757#L522-5 [2022-07-22 03:13:08,018 INFO L754 eck$LassoCheckResult]: Loop: 757#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 771#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 756#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 757#L522-5 [2022-07-22 03:13:08,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:08,019 INFO L85 PathProgramCache]: Analyzing trace with hash -534376483, now seen corresponding path program 1 times [2022-07-22 03:13:08,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:08,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50171096] [2022-07-22 03:13:08,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:08,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 03:13:08,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:13:08,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50171096] [2022-07-22 03:13:08,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50171096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:13:08,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:13:08,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 03:13:08,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259823577] [2022-07-22 03:13:08,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:13:08,126 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:13:08,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:08,126 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2022-07-22 03:13:08,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:08,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291126107] [2022-07-22 03:13:08,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:08,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:08,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:08,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:13:08,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 03:13:08,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 03:13:08,218 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 16 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:13:08,268 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-22 03:13:08,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 03:13:08,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2022-07-22 03:13:08,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 03:13:08,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 28 states and 36 transitions. [2022-07-22 03:13:08,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-22 03:13:08,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-22 03:13:08,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2022-07-22 03:13:08,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:13:08,269 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-07-22 03:13:08,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2022-07-22 03:13:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-22 03:13:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-07-22 03:13:08,271 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-22 03:13:08,271 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-22 03:13:08,271 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 03:13:08,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2022-07-22 03:13:08,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 03:13:08,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:13:08,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:13:08,271 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:13:08,271 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:13:08,271 INFO L752 eck$LassoCheckResult]: Stem: 832#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 833#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 839#L532 assume !(main_~length1~0#1 < 1); 836#L532-2 assume !(main_~length2~0#1 < 1); 830#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 831#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 849#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 850#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 840#L541-4 main_~i~1#1 := 0; 841#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 834#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 835#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 847#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 848#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 852#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 843#L522-5 [2022-07-22 03:13:08,271 INFO L754 eck$LassoCheckResult]: Loop: 843#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 853#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 842#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 843#L522-5 [2022-07-22 03:13:08,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:08,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2022-07-22 03:13:08,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:08,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535895636] [2022-07-22 03:13:08,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:08,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:08,281 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:08,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:08,290 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 2 times [2022-07-22 03:13:08,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:08,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637707819] [2022-07-22 03:13:08,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:08,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:08,307 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:08,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:08,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:08,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2022-07-22 03:13:08,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:08,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876442932] [2022-07-22 03:13:08,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:08,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:08,327 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:08,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:09,225 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:13:09,225 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:13:09,225 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:13:09,225 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:13:09,225 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:13:09,225 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:09,225 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:13:09,225 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:13:09,225 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration7_Lasso [2022-07-22 03:13:09,225 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:13:09,225 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:13:09,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:09,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:10,513 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:13:10,513 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:13:10,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:10,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:10,515 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:10,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 03:13:10,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:10,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:10,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:10,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:10,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:10,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:10,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:10,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:10,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:10,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-22 03:13:10,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:10,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:10,556 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:10,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 03:13:10,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:10,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:10,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:10,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:10,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:10,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:10,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:10,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:10,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:10,583 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 [2022-07-22 03:13:10,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:10,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:10,584 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:10,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 03:13:10,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:10,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:10,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:10,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:10,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:10,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:10,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:10,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:10,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-22 03:13:10,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:10,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:10,612 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:10,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 03:13:10,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:10,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:10,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:10,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:10,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:10,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:10,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:10,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:10,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:10,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-22 03:13:10,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:10,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:10,637 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:10,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 03:13:10,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:10,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:10,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:10,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:10,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:10,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:10,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:10,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:10,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:10,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-22 03:13:10,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:10,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:10,667 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:10,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 03:13:10,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:10,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:10,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:10,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:10,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:10,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:10,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:10,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:10,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:10,697 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 [2022-07-22 03:13:10,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:10,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:10,698 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:10,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 03:13:10,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:10,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:10,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:10,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:10,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:10,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:10,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:10,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:10,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-22 03:13:10,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:10,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:10,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) [2022-07-22 03:13:10,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 03:13:10,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 [2022-07-22 03:13:10,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:10,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:10,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:10,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:10,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:10,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:10,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:10,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:10,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:10,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:10,763 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:10,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 03:13:10,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 [2022-07-22 03:13:10,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:10,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:10,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:10,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:10,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:10,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:10,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:10,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-22 03:13:10,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:10,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:10,795 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:10,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 03:13:10,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:10,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:10,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:10,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:10,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:10,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:10,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:10,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:10,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:10,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:10,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:10,824 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:10,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 03:13:10,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:10,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:10,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:10,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:10,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:10,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:10,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:10,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:10,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-22 03:13:10,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:10,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:10,853 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:10,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 03:13:10,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:10,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:10,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:10,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:10,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:10,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:10,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:10,892 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:13:10,924 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-22 03:13:10,924 INFO L444 ModelExtractionUtils]: 19 out of 58 variables were initially zero. Simplification set additionally 36 variables to zero. [2022-07-22 03:13:10,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:10,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:10,925 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:10,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 03:13:10,927 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:13:10,934 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 03:13:10,934 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:13:10,934 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_4, ULTIMATE.start_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_4 - 1*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [] [2022-07-22 03:13:10,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:11,027 INFO L293 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2022-07-22 03:13:11,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:11,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 03:13:11,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:11,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 03:13:11,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:13:11,139 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-22 03:13:11,139 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:11,179 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) Result 54 states and 67 transitions. Complement of second has 7 states. [2022-07-22 03:13:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 03:13:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-07-22 03:13:11,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 3 letters. [2022-07-22 03:13:11,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:11,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2022-07-22 03:13:11,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:11,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 6 letters. [2022-07-22 03:13:11,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:11,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. [2022-07-22 03:13:11,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 03:13:11,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 40 states and 50 transitions. [2022-07-22 03:13:11,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-22 03:13:11,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-22 03:13:11,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 50 transitions. [2022-07-22 03:13:11,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:13:11,183 INFO L369 hiAutomatonCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-07-22 03:13:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 50 transitions. [2022-07-22 03:13:11,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-07-22 03:13:11,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-22 03:13:11,184 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-22 03:13:11,184 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-22 03:13:11,184 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 03:13:11,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2022-07-22 03:13:11,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 03:13:11,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:13:11,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:13:11,185 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:13:11,185 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:13:11,185 INFO L752 eck$LassoCheckResult]: Stem: 1104#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1111#L532 assume !(main_~length1~0#1 < 1); 1108#L532-2 assume !(main_~length2~0#1 < 1); 1102#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 1103#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 1121#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1122#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1112#L541-4 main_~i~1#1 := 0; 1113#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 1106#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1107#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1119#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 1120#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1123#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1131#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1127#L522-1 assume !cstrcspn_#t~short7#1; 1116#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 1109#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 1110#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 1117#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 1118#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1125#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1115#L522-5 [2022-07-22 03:13:11,185 INFO L754 eck$LassoCheckResult]: Loop: 1115#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1126#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 1114#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 1115#L522-5 [2022-07-22 03:13:11,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:11,185 INFO L85 PathProgramCache]: Analyzing trace with hash -777149455, now seen corresponding path program 1 times [2022-07-22 03:13:11,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:11,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864996270] [2022-07-22 03:13:11,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:11,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:11,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 03:13:11,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:13:11,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864996270] [2022-07-22 03:13:11,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864996270] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 03:13:11,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70121266] [2022-07-22 03:13:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:11,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 03:13:11,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:11,336 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 03:13:11,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-07-22 03:13:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:11,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-22 03:13:11,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:11,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 03:13:11,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-22 03:13:11,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-22 03:13:11,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 03:13:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 03:13:11,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 03:13:11,593 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 03:13:11,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-22 03:13:11,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 03:13:11,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-22 03:13:11,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 03:13:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 03:13:11,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70121266] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 03:13:11,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 03:13:11,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-07-22 03:13:11,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942074974] [2022-07-22 03:13:11,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 03:13:11,695 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:13:11,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:11,695 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 3 times [2022-07-22 03:13:11,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:11,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229295871] [2022-07-22 03:13:11,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:11,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:11,699 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:11,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:11,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:13:11,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 03:13:11,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-07-22 03:13:11,770 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:13:11,943 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-07-22 03:13:11,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 03:13:11,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2022-07-22 03:13:11,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 03:13:11,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 35 states and 44 transitions. [2022-07-22 03:13:11,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-22 03:13:11,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-22 03:13:11,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2022-07-22 03:13:11,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:13:11,945 INFO L369 hiAutomatonCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-07-22 03:13:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2022-07-22 03:13:11,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-07-22 03:13:11,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-07-22 03:13:11,947 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-22 03:13:11,947 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-22 03:13:11,947 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 03:13:11,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2022-07-22 03:13:11,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 03:13:11,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:13:11,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:13:11,948 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:13:11,948 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:13:11,948 INFO L752 eck$LassoCheckResult]: Stem: 1355#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1362#L532 assume !(main_~length1~0#1 < 1); 1359#L532-2 assume !(main_~length2~0#1 < 1); 1353#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 1354#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 1373#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1374#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 1375#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1384#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1363#L541-4 main_~i~1#1 := 0; 1364#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 1357#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1358#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1371#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 1372#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1376#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1368#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1380#L522-1 assume !cstrcspn_#t~short7#1; 1381#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 1360#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 1361#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 1369#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 1370#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1378#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1366#L522-5 [2022-07-22 03:13:11,949 INFO L754 eck$LassoCheckResult]: Loop: 1366#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1379#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 1365#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 1366#L522-5 [2022-07-22 03:13:11,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash 409245907, now seen corresponding path program 2 times [2022-07-22 03:13:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:11,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914454119] [2022-07-22 03:13:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:11,961 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:11,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:11,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:11,973 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 4 times [2022-07-22 03:13:11,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:11,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478871309] [2022-07-22 03:13:11,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:11,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:11,977 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:11,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:11,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:11,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1567281202, now seen corresponding path program 1 times [2022-07-22 03:13:11,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:11,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495867238] [2022-07-22 03:13:11,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:11,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 03:13:12,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:13:12,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495867238] [2022-07-22 03:13:12,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495867238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 03:13:12,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549487304] [2022-07-22 03:13:12,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:12,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 03:13:12,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:12,030 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 03:13:12,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-07-22 03:13:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:12,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-22 03:13:12,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:12,111 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 03:13:12,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-22 03:13:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 03:13:12,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 03:13:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 03:13:12,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549487304] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 03:13:12,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 03:13:12,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2022-07-22 03:13:12,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004760053] [2022-07-22 03:13:12,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 03:13:12,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:13:12,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 03:13:12,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-22 03:13:12,251 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:13:12,328 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-07-22 03:13:12,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 03:13:12,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2022-07-22 03:13:12,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 03:13:12,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 52 states and 64 transitions. [2022-07-22 03:13:12,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-22 03:13:12,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-22 03:13:12,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 64 transitions. [2022-07-22 03:13:12,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:13:12,329 INFO L369 hiAutomatonCegarLoop]: Abstraction has 52 states and 64 transitions. [2022-07-22 03:13:12,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 64 transitions. [2022-07-22 03:13:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2022-07-22 03:13:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-07-22 03:13:12,331 INFO L392 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-07-22 03:13:12,331 INFO L374 stractBuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-07-22 03:13:12,331 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 03:13:12,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2022-07-22 03:13:12,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 03:13:12,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:13:12,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:13:12,332 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:13:12,332 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:13:12,332 INFO L752 eck$LassoCheckResult]: Stem: 1634#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1635#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1641#L532 assume !(main_~length1~0#1 < 1); 1638#L532-2 assume !(main_~length2~0#1 < 1); 1632#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 1633#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 1652#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1653#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 1654#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1664#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1642#L541-4 main_~i~1#1 := 0; 1643#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 1636#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1637#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1650#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 1651#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1655#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1666#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1659#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 1660#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 1639#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 1640#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 1648#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 1649#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1657#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1645#L522-5 [2022-07-22 03:13:12,332 INFO L754 eck$LassoCheckResult]: Loop: 1645#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1658#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 1644#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 1645#L522-5 [2022-07-22 03:13:12,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1365761455, now seen corresponding path program 1 times [2022-07-22 03:13:12,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:12,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406118849] [2022-07-22 03:13:12,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:12,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:12,350 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:12,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:12,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:12,361 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 5 times [2022-07-22 03:13:12,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:12,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793335425] [2022-07-22 03:13:12,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:12,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:12,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:12,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:12,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1174254192, now seen corresponding path program 1 times [2022-07-22 03:13:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:13:12,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646050719] [2022-07-22 03:13:12,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:13:12,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:13:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:12,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:13:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:13:12,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:13:14,409 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:13:14,409 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:13:14,409 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:13:14,409 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:13:14,409 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:13:14,409 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:14,409 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:13:14,409 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:13:14,410 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration10_Lasso [2022-07-22 03:13:14,410 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:13:14,410 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:13:14,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:14,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:14,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:15,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:13:17,113 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:13:17,113 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:13:17,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:17,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:17,114 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:17,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 03:13:17,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:17,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:17,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:17,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:17,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:17,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:17,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:17,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:17,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:17,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-22 03:13:17,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:17,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:17,148 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:17,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 03:13:17,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:17,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:17,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:13:17,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:17,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:17,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:17,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:13:17,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:13:17,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:17,175 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 [2022-07-22 03:13:17,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:17,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:17,177 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:17,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-22 03:13:17,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:17,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:17,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:17,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:17,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:17,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:17,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:17,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:17,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-22 03:13:17,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:17,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:17,209 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:17,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-22 03:13:17,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:17,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:17,217 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2022-07-22 03:13:17,217 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-07-22 03:13:17,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:17,376 INFO L401 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2022-07-22 03:13:17,376 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2022-07-22 03:13:17,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:17,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:17,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:17,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:17,712 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:17,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-22 03:13:17,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:17,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:17,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:17,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:17,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:17,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:17,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:17,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:17,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:17,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:17,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:17,756 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:17,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-22 03:13:17,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:17,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:17,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:17,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:17,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:17,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:17,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:17,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:17,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:17,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:17,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:17,798 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:17,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-22 03:13:17,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:17,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:17,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:17,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:17,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:17,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:17,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:17,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:17,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:17,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:17,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:17,850 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:17,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-22 03:13:17,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:13:17,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:17,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:17,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:17,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:17,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:17,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:17,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:13:17,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-22 03:13:17,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:17,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:17,899 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:17,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 [2022-07-22 03:13:17,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:13:17,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:13:17,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:13:17,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:13:17,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:13:17,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:13:17,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-22 03:13:17,947 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:13:18,032 INFO L443 ModelExtractionUtils]: Simplification made 44 calls to the SMT solver. [2022-07-22 03:13:18,032 INFO L444 ModelExtractionUtils]: 8 out of 64 variables were initially zero. Simplification set additionally 53 variables to zero. [2022-07-22 03:13:18,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:13:18,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:13:18,034 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:13:18,048 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:13:18,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-22 03:13:18,065 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 03:13:18,065 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:13:18,066 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_5, ULTIMATE.start_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_5 - 1*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [] [2022-07-22 03:13:18,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:18,264 INFO L293 tatePredicateManager]: 56 out of 57 supporting invariants were superfluous and have been removed [2022-07-22 03:13:18,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:18,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 03:13:18,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:18,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:18,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 03:13:18,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:13:18,417 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-22 03:13:18,417 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:18,463 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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 56 states and 70 transitions. Complement of second has 7 states. [2022-07-22 03:13:18,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 03:13:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-07-22 03:13:18,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 25 letters. Loop has 3 letters. [2022-07-22 03:13:18,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:18,466 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 03:13:18,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:18,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 03:13:18,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:18,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 03:13:18,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:13:18,588 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-22 03:13:18,588 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:18,633 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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 56 states and 70 transitions. Complement of second has 7 states. [2022-07-22 03:13:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 03:13:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-07-22 03:13:18,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 25 letters. Loop has 3 letters. [2022-07-22 03:13:18,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:18,634 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 03:13:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:13:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:18,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 03:13:18,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:13:18,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 03:13:18,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:13:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:13:18,759 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-22 03:13:18,759 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:18,813 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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 55 states and 72 transitions. Complement of second has 6 states. [2022-07-22 03:13:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 03:13:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:13:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-07-22 03:13:18,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 25 letters. Loop has 3 letters. [2022-07-22 03:13:18,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:18,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 28 letters. Loop has 3 letters. [2022-07-22 03:13:18,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:18,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 25 letters. Loop has 6 letters. [2022-07-22 03:13:18,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:13:18,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 72 transitions. [2022-07-22 03:13:18,817 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 03:13:18,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2022-07-22 03:13:18,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 03:13:18,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 03:13:18,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 03:13:18,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:13:18,818 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 03:13:18,818 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 03:13:18,818 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 03:13:18,818 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 03:13:18,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 03:13:18,818 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 03:13:18,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 03:13:18,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 03:13:18 BoogieIcfgContainer [2022-07-22 03:13:18,822 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 03:13:18,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 03:13:18,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 03:13:18,823 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 03:13:18,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:13:01" (3/4) ... [2022-07-22 03:13:18,825 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 03:13:18,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 03:13:18,825 INFO L158 Benchmark]: Toolchain (without parser) took 17771.96ms. Allocated memory was 56.6MB in the beginning and 151.0MB in the end (delta: 94.4MB). Free memory was 40.1MB in the beginning and 72.1MB in the end (delta: -31.9MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2022-07-22 03:13:18,826 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 46.1MB. Free memory was 28.4MB in the beginning and 28.4MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 03:13:18,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.50ms. Allocated memory is still 56.6MB. Free memory was 39.9MB in the beginning and 33.2MB in the end (delta: 6.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 03:13:18,826 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.44ms. Allocated memory is still 56.6MB. Free memory was 33.2MB in the beginning and 31.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 03:13:18,826 INFO L158 Benchmark]: Boogie Preprocessor took 34.32ms. Allocated memory is still 56.6MB. Free memory was 31.1MB in the beginning and 29.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 03:13:18,826 INFO L158 Benchmark]: RCFGBuilder took 321.88ms. Allocated memory is still 56.6MB. Free memory was 29.6MB in the beginning and 30.7MB in the end (delta: -1.0MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2022-07-22 03:13:18,827 INFO L158 Benchmark]: BuchiAutomizer took 16991.72ms. Allocated memory was 56.6MB in the beginning and 151.0MB in the end (delta: 94.4MB). Free memory was 30.5MB in the beginning and 72.1MB in the end (delta: -41.6MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2022-07-22 03:13:18,827 INFO L158 Benchmark]: Witness Printer took 2.24ms. Allocated memory is still 151.0MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 03:13:18,828 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 46.1MB. Free memory was 28.4MB in the beginning and 28.4MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.50ms. Allocated memory is still 56.6MB. Free memory was 39.9MB in the beginning and 33.2MB in the end (delta: 6.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.44ms. Allocated memory is still 56.6MB. Free memory was 33.2MB in the beginning and 31.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.32ms. Allocated memory is still 56.6MB. Free memory was 31.1MB in the beginning and 29.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 321.88ms. Allocated memory is still 56.6MB. Free memory was 29.6MB in the beginning and 30.7MB in the end (delta: -1.0MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 16991.72ms. Allocated memory was 56.6MB in the beginning and 151.0MB in the end (delta: 94.4MB). Free memory was 30.5MB in the beginning and 72.1MB in the end (delta: -41.6MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * Witness Printer took 2.24ms. Allocated memory is still 151.0MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (5 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[nondetString1] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.9s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 14.9s. Construction of modules took 0.3s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 51 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 492 mSDsluCounter, 758 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 543 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 566 IncrementalHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 215 mSDtfsCounter, 566 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital269 mio100 ax108 hnf100 lsp88 ukn76 mio100 lsp48 div104 bol100 ite100 ukn100 eq177 hnf91 smp91 dnf418 smp73 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 480ms VariablesStem: 13 VariablesLoop: 10 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-22 03:13:18,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-07-22 03:13:19,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-07-22 03:13:19,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE